|
|
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. |
ICALP |
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. |
SODA |
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. |
ICALP |
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. |
ESORICS |
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. |
ICCSA (2) |
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. |
FAW |
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. |
PDCAT |
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. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
56 | Jean Cardinal, Eythan Levy |
Connected Vertex Covers in Dense Graphs. |
APPROX-RANDOM |
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. |
SPAA |
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. |
APPROX |
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. |
APPROX |
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. |
Ann. Math. Artif. Intell. |
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. |
SAGA |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001 |
Parameterized Complexity of Vertex Cover Variants. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
48 | Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001 |
Parameterized Complexity of Generalized Vertex Cover Problems. |
WADS |
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. |
Algorithmica |
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. |
CCTA |
2007 |
DBLP DOI BibTeX RDF |
grass cover change, cellular automata |
48 | Maytham Safar, Sami Habib |
Hard Constrained Vertex-Cover Communication Algorithm for WSN. |
EUC |
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. |
Theory Comput. Syst. |
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. |
STOC |
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 |
FOCS |
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. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Thomas Sauerwald |
Expansion and the cover time of parallel random walks. |
PODC |
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. |
Algorithmica |
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. |
ACM Multimedia |
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. |
International Conference on Computational Science (3) |
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. |
Ann. Oper. Res. |
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. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Quasiperiod, Algorithm, Period, String, Cover, Word |
43 | Fanica Gavril, Alon Itai |
Covering a Tree by a Forest. |
Graph Theory, Computational Intelligence and Thought |
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. |
Algorithmica |
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. |
ACM J. Exp. Algorithmics |
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. |
AICCSA |
2007 |
DBLP DOI BibTeX RDF |
|
39 | Valeri Korjik, Guillermo Morales-Luna |
Information Hiding through Noisy Channels. |
Information Hiding |
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. |
SCG |
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. |
Algorithmica |
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. |
KDD |
2008 |
DBLP DOI BibTeX RDF |
time series, change detection, land use, land cover |
39 | Qizhi Fang, Liang Kong |
Core Stability of Vertex Cover Games. |
WINE |
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. |
EC |
2007 |
DBLP DOI BibTeX RDF |
frugality, auctions, vertex cover |
39 | Tianping Shuai, Xiao-Dong Hu 0001 |
Connected Set Cover Problem and Its Applications. |
AAIM |
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. |
SPAA |
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. |
J. Comb. Optim. |
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. |
J. Intell. Robotic Syst. |
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. |
J. ACM |
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. |
ACM Trans. Design Autom. Electr. Syst. |
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. |
IEEE Trans. Software Eng. |
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. |
Graphs Comb. |
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. |
WALCOM |
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. |
EDBT |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Gruia Calinescu |
Bounding the Payment of Approximate Truthful Mechanisms. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Julia Chuzhoy, Joseph Naor |
Covering Problems with Hard Capacities. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Markus Bläser, Bodo Manthey |
Two Approximation Algorithms for 3-Cycle Covers. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Zongheng Zhou, Samir R. Das, Himanshu Gupta 0001 |
Variable radii connected sensor cover in sensor networks. |
ACM Trans. Sens. Networks |
2009 |
DBLP DOI BibTeX RDF |
sensor networks, connectivity, coverage, Topology control, energy conservation |
35 | Sumit Gulwani, Madan Musuvathi |
Cover Algorithms and Their Combination. |
ESOP |
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. |
HiPC |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Yanli Cai, Wei Lou, Minglu Li 0001 |
Cover Set Problem in Directional Sensor Networks. |
FGCN (1) |
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. |
ICCNMC |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Kamesh Munagala, Shivnath Babu, Rajeev Motwani 0001, Jennifer Widom |
The Pipelined Set Cover Problem. |
ICDT |
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. |
WADS |
2003 |
DBLP DOI BibTeX RDF |
|
35 | Toshihiro Fujito, Tsuyoshi Okumura |
A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
35 | Danny Z. Chen, Xiaobo Hu 0001, Xiaodong Wu 0001 |
Optimal Polygon Cover Problems and Applcations. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
34 | Kasturi R. Varadarajan |
Weighted geometric set cover via quasi-uniform sampling. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
approximation, set cover, epsilon nets |
34 | Eyjolfur Ingi Asgeirsson, Cliff Stein 0001 |
Bounded-space online bin cover. |
J. Sched. |
2009 |
DBLP DOI BibTeX RDF |
Bin cover, Bounded-space, Markov chains, Online |
34 | Hedieh Sajedi, Mansour Jamzad |
Secure Cover Selection Steganography. |
ISA |
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? |
ICDM Workshops |
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. |
CIAA |
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. |
WG |
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. |
IEEE/ACM Trans. Netw. |
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. |
PODC |
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. |
ICADL |
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. |
Graphs Comb. |
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. |
IEEE Trans. Pattern Anal. Mach. Intell. |
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. |
ICDAR |
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. |
STOC |
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. |
STOC |
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. |
Algorithmica |
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. |
FOCS |
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. |
SODA |
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 |
FOCS |
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?. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
Markov Chains, Random Walks |
31 | Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni |
Limitations of cross-monotonic cost sharing schemes. |
SODA |
2005 |
DBLP BibTeX RDF |
|
31 | Ajoy Kumar Datta, Rajesh Patel, Maria Gradinariu |
Distributed Self-Minimum Connected Covering of a Query Region in Sensor Networks. |
ISPAN |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Antonia Bertolino, Martina Marré |
Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs. |
IEEE Trans. Software Eng. |
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). |
ICALP (1) |
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. |
ISM |
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. |
FSKD (3) |
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. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Jiang Li |
Hierarchical land cover information retrieval in object-oriented remote sensing image databases with native queries. |
ACM Southeast Regional Conference |
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. |
GPC |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Alain Casali, Rosine Cicchetti, Lotfi Lakhal |
Essential Patterns: A Perfect Cover of Frequent Patterns. |
DaWaK |
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. |
SOFSEM |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Faisal N. Abu-Khzam, Michael A. Langston |
A Direct Algorithm for the Parameterized Face Cover Problem. |
IWPEC |
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. |
J. Geogr. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Rolf Niedermeier, Peter Rossmanith |
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Cezar Câmpeanu, Nicolae Santean, Sheng Yu 0001 |
Minimal Cover-Automata for Finite Languages. |
Workshop on Implementing Automata |
1998 |
DBLP DOI BibTeX RDF |
|
30 | Ravi S. Sandhu, Sushil Jajodia |
Polyinstantation for Cover Stories. |
ESORICS |
1992 |
DBLP DOI BibTeX RDF |
|
30 | Ruoming Jin, Yang Xiang, Lin Liu 0001 |
Cartesian contour: a concise representation for a collection of frequent sets. |
KDD |
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. |
PODC |
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. |
EvoWorkshops |
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. |
CCGRID |
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][ >>] |
|