|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5200 occurrences of 3027 keywords
|
|
|
Results
Found 12402 publication records. Showing 12384 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
82 | Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan |
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 164-175, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
capacitated covering, Approximation algorithms, linear programming, set cover, vertex cover, randomized rounding |
78 | Özgür Sümer |
Partial covering of hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 572-581, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
partial hypergraph cover, partial set cover, greedy algorithm |
70 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan |
Approximation Algorithms for Partial Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 225-236, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Approximation algorithms, set cover, vertex cover, randomized rounding, primal-dual methods, partial covering |
61 | Nayantara Mallesh, Matthew K. Wright |
Countering Statistical Disclosure with Receiver-Bound Cover Traffic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESORICS ![In: Computer Security - ESORICS 2007, 12th European Symposium On Research In Computer Security, Dresden, Germany, September 24-26, 2007, Proceedings, pp. 547-562, 2007, Springer, 978-3-540-74834-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
cover traffic, anonymity, privacy-enhancing technologies |
61 | Jianqing Xi, Fuqiang Chen, Pingjian Zhang |
A New Bitmap Index and a New Data Cube Compression Technology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (2) ![In: Computational Science and Its Applications - ICCSA 2008, International Conference, Perugia, Italy, June 30 - July 3, 2008, Proceedings, Part II, pp. 1218-1228, 2008, Springer, 978-3-540-69840-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
qcbit index, seqkey cover quotient cube, quotient cube, cover quotient cube, data cube, bitmap index |
61 | Katerina Asdre, Stavros D. Nikolopoulos |
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings, pp. 208-220, 2008, Springer, 978-3-540-69310-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
fixed-endpoint path cover, complement reducible graphs, linear-time algorithms, perfect graphs, cographs, path cover |
61 | Kezhong Lu, XiaoHui Lin 0001, Fengxia Ding |
A Local Voronoi Diagram-Based Approximate Algorithm for Minimum Disc Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007), 3-6 December 2007, Adelaide, Australia, pp. 421-425, 2007, IEEE Computer Society, 0-7695-3049-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
minimum disc cover problem, disc cover set, average coverage degree, wireless sensor network, node scheduling |
56 | Ulrike Stege, Iris van Rooij, Alexander Hertel, Philipp Hertel |
An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 249-261, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
56 | Jean Cardinal, Eythan Levy |
Connected Vertex Covers in Dense Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 35-48, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
connected vertex cover, dense graph, approximation algorithm, vertex cover |
56 | Matti Åstrand, Jukka Suomela |
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010, pp. 294-302, 2010, ACM, 978-1-4503-0079-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
edge packing, distributed algorithm, local algorithm, set cover, vertex cover, anonymous network |
52 | Eran Halperin, Aravind Srinivasan |
Improved Approximation Algorithms for the Partial Vertex Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 161-174, 2002, Springer, 3-540-44186-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Partial vertex cover, approximation algorithms, semidefinite programming, randomized rounding |
52 | Reuven Bar-Yehuda |
One for the Price of Two: A Unified Approach for Approximating Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings, pp. 49-62, 1998, Springer, 3-540-64736-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Generalized Steiner Forest, Randomized Approximations, Approximation Algorithm, Set Cover, Vertex Cover, Covering Problems, Local Ratio, Feedback Vertex Set |
52 | Adam Cannon, Lenore Cowen |
Approximation Algorithms for the Class Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 40(3-4), pp. 215-224, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
disk cover, margin classifier, classification, approximation algorithms, set cover |
48 | Yoshiaki Nonaka, Hirotaka Ono 0001, Kunihiko Sadakane, Masafumi Yamashita |
How to Design a Linear Cover Time Random Walk on a Finite Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, 5th International Symposium, SAGA 2009, Sapporo, Japan, October 26-28, 2009. Proceedings, pp. 104-116, 2009, Springer, 978-3-642-04943-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001 |
Parameterized Complexity of Vertex Cover Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(3), pp. 501-520, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
48 | Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001 |
Parameterized Complexity of Generalized Vertex Cover Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, pp. 36-48, 2005, Springer, 3-540-28101-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Min-Te Sun, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang Lai |
An Optimal Algorithm for the Minimum Disc Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(1), pp. 58-71, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Minimum disc cover, ?-hull, Applications in ad hoc networks, Optimal algorithms |
48 | Shuai Zhang, Jingyin Zhao, Linyi Li |
Grass Cover Change Model Based on Cellular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCTA ![In: Computer And Computing Technologies In Agriculture, Volume II, First IFIP TC 12 International Conference on Computer and Computing Technologies in Agriculture (CCTA 2007), Wuyishan, China, August 18-20, 2007, pp. 825-832, 2007, Springer, 978-0-387-77252-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
grass cover change, cellular automata |
48 | Maytham Safar, Sami Habib |
Hard Constrained Vertex-Cover Communication Algorithm for WSN. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUC ![In: Embedded and Ubiquitous Computing, International Conference, EUC 2007, Taipei, Taiwan, December 17-20, 2007, Proceedings, pp. 635-649, 2007, Springer, 978-3-540-77091-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
discrete space, Wireless sensor network, optimization, communication, vertex cover, evolutionary approach |
47 | Daniel Mölle, Stefan Richter 0001, Peter Rossmanith |
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 43(2), pp. 234-253, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Enumerate and expand, Exact algorithms, Vertex cover, Parameterized complexity |
47 | Petr Slavík |
A Tight Analysis of the Greedy Algorithm for Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, pp. 435-441, 1996, ACM, 0-89791-785-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
fractional set cover, partial set cover, approximation algorithms, greedy algorithm, set cover |
47 | Bonnie Berger, John Rompel, Peter W. Shor |
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 54-59, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
unweighted set cover problems, efficient NC algorithms, NC approximation algorithms, weighted set cover problems, set cover algorithm, finite union, finite intersection, finite VC dimension, NC hypothesis finder, linear-processor NC algorithm, computational geometry, learning theory, closure, concept class |
44 | Julián Mestre |
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pp. 182-191, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Thomas Sauerwald |
Expansion and the cover time of parallel random walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 315-324, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
random walks, expander, expansion, cover time |
43 | Julián Mestre |
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 227-239, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Vertex cover, Primal-dual algorithms |
43 | Yi Yu 0001, J. Stephen Downie, Fabian Mörchen, Lei Chen 0002, Kazuki Joe, Vincent Oria |
COSIN: content-based retrieval system for cover songs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Multimedia ![In: Proceedings of the 16th International Conference on Multimedia 2008, Vancouver, British Columbia, Canada, October 26-31, 2008, pp. 987-988, 2008, ACM, 978-1-60558-303-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
cover songs, musical audio sequences summarization, content-based audio retrieval, hash-based indexing |
43 | Jihui Wang, Sumei Zhang, Jianfeng Hou |
On f -Edge Cover-Coloring of Simple Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III, pp. 448-452, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Simple graph, f-edge cover-coloring, Edge-coloring |
43 | Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin |
An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 131(1-4), pp. 283-304, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
minimum weight vertex cover, meta-heuristic algorithm, ant colony optimization |
43 | Yin Li, William F. Smyth |
Computing the Cover Array in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(1), pp. 95-106, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Quasiperiod, Algorithm, Period, String, Cover, Word |
43 | Fanica Gavril, Alon Itai |
Covering a Tree by a Forest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graph Theory, Computational Intelligence and Thought ![In: Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday, pp. 66-76, 2009, Springer, 978-3-642-02028-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
vertex-cover of a tree by a forest, edge-cover of a tree by a forest, graph algorithms |
43 | Reuven Bar-Yehuda |
One for the Price of Two: a Unified Approach for Approximating Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 27(2), pp. 131-144, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Generalized Steiner Forest, Randomized approximations, Approximation algorithm, Set Cover, Vertex Cover, Covering problems, Primal-dual, Local ratio, Feedback Vertex Set |
43 | Torsten Fahle, Karsten Tiemann |
A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 11, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
test-cover problem, variable fixing, Branch-and-bound, Lagrangian relaxation, set-cover problem |
39 | Maytham Safar, Mohammad Taha, Sami Habib |
Modeling the Communication Problem in Wireless Sensor Networks as a Vertex Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: 2007 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2007), 13-16 May 2007, Amman, Jordan, pp. 592-598, 2007, IEEE Computer Society, 1-4244-1030-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
39 | Valeri Korjik, Guillermo Morales-Luna |
Information Hiding through Noisy Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Information Hiding ![In: Information Hiding, 4th International Workshop, IHW 2001, Pittsburgh, PA, USA, April 25-27, 2001, Proceedings, pp. 42-50, 2001, Springer, 3-540-42733-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
cover message, wire-trap channel concept, information-theoretically secure model, randomized encoding, linear binary codes, Information hiding |
39 | Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled |
On the set multi-cover problem in geometric settings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 341-350, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
set cover, cuttings, LP rounding |
39 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Tight Results on Minimum Entropy Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 51(1), pp. 49-60, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Entropy, Greedy algorithm, Hardness of approximation, Set cover |
39 | Shyam Boriah, Vipin Kumar 0001, Michael S. Steinbach, Christopher Potter, Steven A. Klooster |
Land cover change detection: a case study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24-27, 2008, pp. 857-865, 2008, ACM, 978-1-60558-193-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
time series, change detection, land use, land cover |
39 | Qizhi Fang, Liang Kong |
Core Stability of Vertex Cover Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings, pp. 482-490, 2007, Springer, 978-3-540-77104-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Vertex cover game, stable core, largeness, exactness, balanced, extendability |
39 | Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg |
Frugality ratios and improved truthful mechanisms for vertex cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007, pp. 336-345, 2007, ACM, 978-1-59593-653-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
frugality, auctions, vertex cover |
39 | Tianping Shuai, Xiao-Dong Hu 0001 |
Connected Set Cover Problem and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings, pp. 243-254, 2006, Springer, 3-540-35157-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Set cover, Wavelength assignment, Performance ratio |
39 | Noga Alon, Yossi Azar, Shai Gutner |
Admission control to minimize rejections and online set cover with repetitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 238-244, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
admission control, competitive, set cover, on-line |
39 | Toshihiro Fujito |
On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(4), pp. 439-452, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
covering integer program, approximation algorithm, combinatorial optimization, partial cover |
39 | Giles M. Foody |
Mapping Land Cover from Remotely Sensed Data with a Softened Feedforward Neural Network Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 29(4), pp. 433-449, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
soft classification, neural network, remote sensing, land cover |
39 | Uriel Feige |
A Threshold of ln n for Approximating Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(4), pp. 634-652, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
set cover, approximation ratio |
39 | C.-J. Richard Shi, Janusz A. Brzozowski |
Cluster-cover a theoretical framework for a class of VLSI-CAD optimization problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 3(1), pp. 76-107, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
cluster-cover, logic minimizaiton, self-checking logic design, topological routing, NP-completeness, state assignment |
39 | Anthony Chung, Deepinder P. Sidhu |
On Conditions for Defining a Closed Cover to Verify Progress for Communicating Finite State Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(11), pp. 1491-1494, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
progress verification, closed cover, FIFO channels, structural partition technique, protocols, finite automata, lossless, communicating finite state machines |
39 | Gennian Ge, Alan C. H. Ling |
Constructions of Quad-Rooted Double Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(2), pp. 231-238, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Orthogonal double cover, Quad-rooted double cover, Group divisible design |
39 | Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi |
Minmax Tree Cover in the Euclidean Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 202-213, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Minmax Tree Cover, Balanced Partition, Tree Cover, Approximation Algorithms, Graph Algorithms |
35 | Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin 0001, Haixun Wang, Philip S. Yu |
Fast computing reachability labelings for large graphs with high compression rate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2008, 11th International Conference on Extending Database Technology, Nantes, France, March 25-29, 2008, Proceedings, pp. 193-204, 2008, ACM, 978-1-59593-926-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Gruia Calinescu |
Bounding the Payment of Approximate Truthful Mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 221-233, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Julia Chuzhoy, Joseph Naor |
Covering Problems with Hard Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 481-489, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Markus Bläser, Bodo Manthey |
Two Approximation Algorithms for 3-Cycle Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 40-50, 2002, Springer, 3-540-44186-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Zongheng Zhou, Samir R. Das, Himanshu Gupta 0001 |
Variable radii connected sensor cover in sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Sens. Networks ![In: ACM Trans. Sens. Networks 5(1), pp. 8:1-8:36, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
sensor networks, connectivity, coverage, Topology control, energy conservation |
35 | Sumit Gulwani, Madan Musuvathi |
Cover Algorithms and Their Combination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESOP ![In: Programming Languages and Systems, 17th European Symposium on Programming, ESOP 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings, pp. 193-207, 2008, Springer, 978-3-540-78738-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Sushil K. Prasad, Akshaye Dhawan |
Distributed Algorithms for Lifetime of Wireless Sensor Networks Based on Dependencies Among Cover Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2007, 14th International Conference, Goa, India, December 18-21, 2007, Proceedings, pp. 381-392, 2007, Springer, 978-3-540-77219-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Yanli Cai, Wei Lou, Minglu Li 0001 |
Cover Set Problem in Directional Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FGCN (1) ![In: Future Generation Communication and Networking, FGCN 2007, Ramada Plaza Jeju, Jeju-Island, Korea, December 6-8, 2007, Proceedings, pp. 274-278, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Min-Te Sun, Xiaoli Ma, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang Lai |
Minimum Disc Cover Set Construction in Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCNMC ![In: Networking and Mobile Computing, Third International Conference, ICCNMC 2005, Zhangjiajie, China, August 2-4, 2005, Proceedings, pp. 712-721, 2005, Springer, 3-540-28102-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Kamesh Munagala, Shivnath Babu, Rajeev Motwani 0001, Jennifer Widom |
The Pipelined Set Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings, pp. 83-98, 2005, Springer, 3-540-24288-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Elena Prieto-Rodriguez, Christian Sloper |
Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings, pp. 474-483, 2003, Springer, 3-540-40545-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
35 | Toshihiro Fujito, Tsuyoshi Okumura |
A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, pp. 670-681, 2001, Springer, 3-540-42985-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
35 | Danny Z. Chen, Xiaobo Hu 0001, Xiaodong Wu 0001 |
Optimal Polygon Cover Problems and Applcations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 564-576, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
34 | Kasturi R. Varadarajan |
Weighted geometric set cover via quasi-uniform sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 641-648, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
approximation, set cover, epsilon nets |
34 | Eyjolfur Ingi Asgeirsson, Cliff Stein 0001 |
Bounded-space online bin cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 12(5), pp. 461-474, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bin cover, Bounded-space, Markov chains, Online |
34 | Hedieh Sajedi, Mansour Jamzad |
Secure Cover Selection Steganography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISA ![In: Advances in Information Security and Assurance, Third International Conference and Workshops, ISA 2009, Seoul, Korea, June 25-27, 2009. Proceedings, pp. 317-326, 2009, Springer, 978-3-642-02616-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Cover Selection, Steganography Capacity, Steganography |
34 | ZongBo Shang, Jeffrey D. Hamerlinck |
Using Statistics and Spatial Data Mining to Study Land Cover in Wyoming : Can We Predict Vegetation Types from Environmental Variables? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: Workshops Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), October 28-31, 2007, Omaha, Nebraska, USA, pp. 661-666, 2007, IEEE Computer Society, 0-7695-3033-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Wyoming, discriminant analysis, Factor analysis, land cover, classification and regression tree |
34 | Jean-Marc Champarnaud, Franck Guingne, Jacques Farré |
Reducing Acyclic Cover Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers, pp. 38-50, 2007, Springer, 978-3-540-76335-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
subsequential transducer, cover transducer for a finite subsequential function, finite state transducer, state reduction |
34 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
Complexity and Approximation Results for the Connected Vertex Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 202-213, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Connected vertex cover, APX-complete, approximation algorithm, planar graphs, bipartite graphs, chordal graphs |
34 | Himanshu Gupta 0001, Zongheng Zhou, Samir R. Das, Quinyi Gu |
Connected sensor cover: self-organization of sensor networks for efficient query execution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 14(1), pp. 55-67, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
connected sensor cover, sensor connectivity, sensor networks, query optimization, sensor coverage |
34 | Fabrizio Grandoni 0001, Jochen Könemann, Alessandro Panconesi, Mauro Sozio |
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005, pp. 118-125, 2005, ACM, 1-58113-994-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithms, distributed algorithms, vertex cover, primal-dual algorithms |
34 | Lixu Gu |
Character Region Identification from Cover Images Using DTT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICADL ![In: Digital Libraries: International Collaboration and Cross-Fertilization, 7th International Conference on Asian Digital Libraries, ICADL 2004, Shanghai, China, December 13-17, 2004, Proceedings, pp. 388-397, 2004, Springer, 3-540-24030-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Optical Character Reader, Cover Image, Region Identification, DTT |
34 | Jonathan David Farley |
Quasi-Differential Posets and Cover Functions of Distributive Lattices II: A Problem in Stanley's Enumerative Combinatorics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 19(4), pp. 475-491, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Differential poset, Fibonacci lattice, (partially) Ordered set, Cover function, Distributive lattice |
34 | Charles R. Tolle, Timothy R. McJunkin, David J. Gorisch |
Suboptimal Minimum Cluster Volume Cover-Based Method for Measuring Fractal Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 25(1), pp. 32-41, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
suboptimal cover, box counting, clustering, texture analysis, Fuzzy-C means, Fractal dimension |
34 | Jenchyou Lii, Sargur N. Srihari |
Location of name and address on fax cover pages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume II, pp. 756-759, 1995, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
fax cover pages, mail routing system, block segmentation, data field indicators, machined-printed images, handwritten images, image recognition, page segmentation, geometric features, text recognition, document analysis system, image extraction |
34 | Yossi Azar, Iftah Gamzu, Xiaoxin Yin |
Multiple intents re-ranking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 669-678, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
min-sum set cover, minimum latency set cover, multiple intents, approximation algorithms, ranking |
34 | Yuichi Yoshida, Masaki Yamamoto 0001, Hiro Ito |
An improved constant-time approximation algorithm for maximum matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 225-234, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover |
34 | Venkatesh Raman 0001, Saket Saurabh 0001 |
Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(2), pp. 203-225, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
t-vertex cover, Dominating set, Set cover, Independent set, Parameterized complexity |
34 | Matt Gibson 0001, Kasturi R. Varadarajan |
Decomposing Coverings and the Planar Sensor Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 159-168, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Decomposing Multiple Coverings, Sensor Cover, Restricted Strip Cover, Approximation Algorithms |
34 | Reuven Bar-Yehuda |
Using Homogenous Weights for Approximating the Partial Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA., pp. 71-75, 1999, ACM/SIAM, 0-89871-434-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
approximation algorithm, set cover, vertex cover, knapsack, covering problems, local ratio, partial covering |
34 | Sridhar Rajagopalan, Vijay V. Vazirani |
Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 322-331, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
randomized voting, primal-dual RNC approximation algorithms, covering integer programs, classical greedy sequential set cover algorithm, parallel approximation algorithms, randomization, set cover problem |
31 | Klim Efremenko, Omer Reingold |
How Well Do Random Walks Parallelize?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 476-489, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Markov Chains, Random Walks |
31 | Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni |
Limitations of cross-monotonic cost sharing schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 602-611, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
31 | Ajoy Kumar Datta, Rajesh Patel, Maria Gradinariu |
Distributed Self-Minimum Connected Covering of a Query Region in Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 8th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2005, December 7-9. 2005, Las Vegas, Nevada, USA, pp. 448-453, 2005, IEEE Computer Society, 0-7695-2509-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Antonia Bertolino, Martina Marré |
Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(12), pp. 885-899, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
program branch testing, program flowgraph, program inputs, ddgraph, graph theoretic principles, arc trees, unconstrained arcs, implied tree, recursive iteration, software analysis tool, automated testing tool, software tools, program testing, flexibility, trees (mathematics), dominance, program diagnostics, control flow analysis, simplicity, implication, program control structures, flow graphs, dominator tree, selection strategy, infeasible paths, software testing tool, path covers |
30 | Chen Avin, Michal Koucký 0001, Zvi Lotker |
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 121-132, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Yi Yu 0001, J. Stephen Downie, Fabian Mörchen, Lei Chen 0002, Kazuki Joe |
Using Exact Locality Sensitive Mapping to Group and Detect Audio-Based Cover Songs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISM ![In: Tenth IEEE International Symposium on Multimedia (ISM2008), December 15-17, 2008, Berkeley, California, USA, pp. 302-309, 2008, IEEE Computer Society, 978-0-7695-3454-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Hao-xiang Wu, Qi-ting Huang, Lian-qing Zhou, Iwao Okutani |
Identification of Band Reflectance for Each Category and Land-Cover Classification Using Fuzzy Least-Squares Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (3) ![In: Fifth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008, 18-20 October 2008, Jinan, Shandong, China, Proceedings, Volume 3, pp. 47-53, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis |
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 702-712, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Jiang Li |
Hierarchical land cover information retrieval in object-oriented remote sensing image databases with native queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 45th Annual Southeast Regional Conference, 2007, Winston-Salem, North Carolina, USA, March 23-24, 2007, pp. 467-472, 2007, ACM, 978-1-59593-629-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
clustering, information retrieval, object-oriented databases, remote sensing, change detection |
30 | HongLiang Yuan, Changguo Guo, Peng Zou |
The Subscription-Cover Based Routing Algorithm in Content-Based Publish/Subscribe. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GPC ![In: Advances in Grid and Pervasive Computing, First International Conference, GPC 2006, Taichung, Taiwan, May 3-5, 2006, Proceedings, pp. 103-114, 2006, Springer, 3-540-33809-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Alain Casali, Rosine Cicchetti, Lotfi Lakhal |
Essential Patterns: A Perfect Cover of Frequent Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DaWaK ![In: Data Warehousing and Knowledge Discovery, 7th International Conference, DaWaK 2005, Copenhagen, Denmark, August 22-26, 2005, Proceedings, pp. 428-437, 2005, Springer, 3-540-28558-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière |
Greedy Differential Approximations for Min Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings, pp. 62-71, 2005, Springer, 3-540-24302-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Faisal N. Abu-Khzam, Michael A. Langston |
A Direct Algorithm for the Parameterized Face Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 213-222, 2004, Springer, 3-540-23071-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Robert Gilmore Pontius Jr., Aditya Agrawal, Diana Huffaker |
Estimating the uncertainty of land-cover extrapolations while constructing a raster map from tabular data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Geogr. Syst. ![In: J. Geogr. Syst. 5(3), pp. 253-273, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Rolf Niedermeier, Peter Rossmanith |
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 180-191, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Cezar Câmpeanu, Nicolae Santean, Sheng Yu 0001 |
Minimal Cover-Automata for Finite Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Implementing Automata ![In: Automata Implementation, Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers, pp. 43-56, 1998, Springer, 3-540-66652-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
30 | Ravi S. Sandhu, Sushil Jajodia |
Polyinstantation for Cover Stories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESORICS ![In: Computer Security - ESORICS 92, Second European Symposium on Research in Computer Security, Toulouse, France, November 23-25, 1992, Proceedings, pp. 307-328, 1992, Springer, 3-540-56246-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
30 | Ruoming Jin, Yang Xiang, Lin Liu 0001 |
Cartesian contour: a concise representation for a collection of frequent sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28 - July 1, 2009, pp. 417-426, 2009, ACM, 978-1-60558-495-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
concise pattern representation, frequent itemsets, set cover, cartesian product |
30 | Costas Busch, Ryan LaFortune, Srikanta Tirthapura |
Improved sparse covers for graphs excluding a fixed minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pp. 61-70, 2007, ACM, 978-1-59593-616-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
minor free graph, path separator, sparse cover, planar graph, compact routing |
30 | Alexandre H. L. Porto, Valmir Carneiro Barbosa |
A Methodology for Determining Amino-Acid Substitution Matrices from Set Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC, Budapest, Hungary, April 10-12, 2006, Proceedings, pp. 138-148, 2006, Springer, 3-540-33237-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Substitution matrix, Residue set cover, Sequence alignment |
30 | James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon |
A Parallel FPT Application For Clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCGRID ![In: 3rd IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2003), 12-15 May 2003, Tokyo, Japan, pp. 70-77, 2003, IEEE Computer Society, 0-7695-1919-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Fixed-Parameter Tractatbility, k-Vertex Cover, Computational Biochemistry |
Displaying result #1 - #100 of 12384 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|