|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2868 occurrences of 1891 keywords
|
|
|
Results
Found 6702 publication records. Showing 6702 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
104 | Tao Feng 0010, Ju-Sheng Mi, Wei-Zhi Wu 0001 |
Covering-Based Generalized Rough Fuzzy Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, First International Conference, RSKT 2006, Chongqing, China, July 24-26, 2006, Proceedings, pp. 208-215, 2006, Springer, 3-540-36297-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
covering-based lower and upper approximations, reduction, covering, Rough fuzzy sets |
74 | Jun Hu 0002, Guoyin Wang 0001 |
Knowledge Reduction of Covering Approximation Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Comput. Sci. ![In: Transactions on Computational Science V, Special Issue on Cognitive Knowledge Representation, pp. 69-80, 2009, Springer, 978-3-642-02096-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
rough sets, reduction, Covering, granule |
68 | William Zhu 0001, Fei-Yue Wang 0001 |
On Three Types of Covering-Based Rough Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 19(8), pp. 1131-1144, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
data mining, Rough sets, approximation, fuzzy sets, reduct, granular computing, covering, computing with words |
67 | Keyun Qin, Yan Gao, Zheng Pei 0001 |
On Covering Rough Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, Second International Conference, RSKT 2007, Toronto, Canada, May 14-16, 2007, Proceedings, pp. 34-41, 2007, Springer, 978-3-540-72457-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
covering rough set, covering lower approximation, covering upper approximation, representative element, Rough set |
63 | Mingwen Chen, Songlin Hu, Zhiyong Liu 0002 |
Covering-Based Routing Algorithms for Cyclic Content-Based P/S System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings, pp. 51-62, 2009, Springer, 978-3-642-02269-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
cyclic topology, covering-based routing, content-based routing, publish/subscribe system |
60 | Qinghua Zhang 0001, Guoyin Wang 0001, Jun Hu 0002, Hai-Tao Teng |
Approximation Partition Spaces of Covering Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GrC ![In: 2007 IEEE International Conference on Granular Computing, GrC 2007, San Jose, California, USA, 2-4 November 2007, pp. 199-204, 2007, IEEE Computer Society, 0-7695-3032-X. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
57 | Abderrazak Zahour, Bruno Taconet, Laurence Likforman-Sulem, Wafa Boussellaa |
Overlapping and multi-touching text-line segmentation by Block Covering analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 12(4), pp. 335-351, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Block covering, Text-line segmentation, Overlapping and multi-touching lines, Block Counting, Ancient Arabic documents |
57 | Dean S. Hoskins, Charles J. Colbourn, Douglas C. Montgomery |
Software performance testing using covering arrays: efficient screening designs with categorical factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WOSP ![In: Proceedings of the Fifth International Workshop on Software and Performance, WOSP 2005, Palma, Illes Balears, Spain, July 12-14, 2005, pp. 131-136, 2005, ACM, 1-59593-087-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
D-optimal designs, performance testing, covering arrays |
57 | Sosina Martirosyan, Tran van Trung |
On t-Covering Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 32(1-3), pp. 323-339, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
t-covering arrays, perfect hash families, orthogonal arrays, algebraic-geometric codes |
57 | 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 |
54 | Paulo F. Flores, Horácio C. Neto, João P. Marques Silva |
On Applying Set Covering Models to Test Set Compaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Symposium on VLSI ![In: 9th Great Lakes Symposium on VLSI (GLS-VLSI '99), 4-6 March 1999, Ann Arbor, MI, USA, pp. 8-11, 1999, IEEE Computer Society, 0-7695-0104-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Test Set Compaction, Unate Covering Problem, Test Pattern Generation, Set Covering |
51 | Yan Wang 0014, Jianguo Lu, Jessica Chen |
Crawling Deep Web Using a New Set Covering Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, 5th International Conference, ADMA 2009, Beijing, China, August 17-19, 2009. Proceedings, pp. 326-337, 2009, Springer, 978-3-642-03347-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
deep web crawling, greedy algorithm, set covering problem |
51 | Sandro Fouché, Myra B. Cohen, Adam A. Porter |
Towards incremental adaptive covering arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESEC/SIGSOFT FSE ![In: Proceedings of the 6th joint meeting of the European Software Engineering Conference and the ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2007, Dubrovnik, Croatia, September 3-7, 2007, pp. 557-560, 2007, ACM, 978-1-59593-811-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
fault localization, covering array |
51 | Selda Küçükçifçi, Charles C. Lindner |
Minimum Covering for Hexagon Triple Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 32(1-3), pp. 251-265, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
hexagon triple system, minimum covering, perfect |
49 | Achill Schürmann, Frank Vallentin |
Computational Approaches to Lattice Packing and Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 35(1), pp. 73-116, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
49 | Zehai Li, Jigui Sun, Jun Zhao, Haihong Yu |
Transforming Non-covering Dimensions in OLAP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb ![In: Web Technologies Research and Development - APWeb 2005, 7th Asia-Pacific Web Conference, Shanghai, China, March 29 - April 1, 2005, Proceedings, pp. 381-393, 2005, Springer, 3-540-25207-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
48 | B. K. Tripathy 0001, G. K. Panda |
On Covering Based Approximations of Classifications of Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Next-Generation Applied Intelligence, 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2009, Tainan, Taiwan, June 24-27, 2009. Proceedings, pp. 777-786, 2009, Springer, 978-3-642-02567-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximations of classifications, covering based rough sets and covering based approximations of classifications, Classifications, rough sets |
48 | Gerzson Kéri, Patric R. J. Östergård |
Bounds for Covering Codes over Large Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 37(1), pp. 45-60, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
covering code, q-ary code, surjective code, covering radius |
48 | Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr. |
Covering Radius 1985-1994. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 8(3), pp. 173-239, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Amalgamated direct sum, Blockwise direct sum, Density of coverings, Dual distance, Excess method, Sphere-covering bound, Normality, Reed-Muller codes, Covering radius, Binary codes, BCH codes |
46 | Yi Zhang, Chengwei Ma, Junfang Zhang, Midao Qin, Ruichun Liu |
Heat Loss Through Covering Layer. ![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. 1379-1382, 2007, Springer, 978-0-387-77252-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
covering material, heat radiation, theoretical model, heat transfer, greenhouse |
46 | Victor Chepoi, Bertrand Estellon |
Packing and Covering delta -Hyperbolic Spaces by Balls. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, pp. 59-73, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithm, metric space, packing, covering, ball |
46 | Tingquan Deng, Yanmei Chen |
On Reduction of Morphological Covering Rough Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD ![In: Fuzzy Systems and Knowledge Discovery, Third International Conference, FSKD 2006, Xi'an, China, September 24-28, 2006, Proceedings, pp. 266-275, 2006, Springer, 3-540-45916-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
morphological covering, Rough set, reduction, morphological operators, adjunction |
46 | Chaoying Dai, Pak Ching Li, Michel Toulouse |
A Cooperative Multilevel Tabu Search Algorithm for the Covering Design Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artificial Evolution ![In: Artificial Evolution, 7th International Conference, Evolution Artificielle, EA 2005, Lille, France, October 26-28, 2005, Revised Selected Papers, pp. 119-130, 2005, Springer, 3-540-33589-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Multilevel algorithms, Covering design problem, Tabu search meta-heuristic |
46 | Masaaki Harada, Michio Ozeki, Kenichiro Tanabe |
On the Covering Radius of Ternary Extremal Self-Dual Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 33(2), pp. 149-158, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
ternary code, covering radius, self-dual code |
46 | Christian Plessl, Marco Platzner |
Instance-Specific Accelerators for Minimum Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 26(2), pp. 109-129, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
instance-specific acceleration, minimum covering, reconfigurable computing |
46 | 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 |
44 | Yang Li, Lijun Ji, Jianxing Yin |
Covering arrays of strength 3 and 4 from holey difference matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 50(3), pp. 339-350, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05B20, 94C12, 05B15 |
44 | Christos Koufogiannakis, Neal E. Young |
Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 634-652, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Tong-Jun Li |
Rough Approximation Operators in Covering Approximation Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSCTC ![In: Rough Sets and Current Trends in Computing, 5th International Conference, RSCTC 2006, Kobe, Japan, November 6-8, 2006, Proceedings, pp. 174-182, 2006, Springer, 3-540-47693-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
rough sets, partitions, coverings, Approximation operators |
44 | Anupam Gupta 0001, Aravind Srinivasan |
On the Covering Steiner Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings, pp. 244-251, 2003, Springer, 3-540-20680-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | K. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal |
Lower Bounds for Group Covering Designs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 13th International Symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999, Proceedings, pp. 334-345, 1999, Springer, 3-540-66723-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
40 | Baoqing Jiang, Keyun Qin, Zheng Pei 0001 |
On Transitive Uncertainty Mappings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, Second International Conference, RSKT 2007, Toronto, Canada, May 14-16, 2007, Proceedings, pp. 42-49, 2007, Springer, 978-3-540-72457-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
covering rough set, covering lower approximation, covering upper approximation, representative element, Rough set |
40 | Renée C. Bryce, Charles J. Colbourn |
Test prioritization for pairwise interaction coverage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGSOFT Softw. Eng. Notes ![In: ACM SIGSOFT Softw. Eng. Notes 30(4), pp. 1-7, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
biased covering arrays, pairwise interaction coverage, greedy algorithm, covering arrays, software interaction testing, mixed-level covering arrays |
40 | Renée C. Bryce, Charles J. Colbourn |
Test prioritization for pairwise interaction coverage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
A-MOST ![In: Proceedings of the ICSE 2005 Workshop on Advances in Model-Based Software Testing, A-MOST 2005, St. Louis, Missouri, USA, 2005, ACM, 1-59593-115-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
biased covering arrays, pairwise interaction coverage, greedy algorithm, covering arrays, software interaction testing, mixed-level covering arrays |
40 | Renée C. Bryce, Charles J. Colbourn |
Constructing interaction test suites with greedy algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: 20th IEEE/ACM International Conference on Automated Software Engineering (ASE 2005), November 7-11, 2005, Long Beach, CA, USA, pp. 440-443, 2005, ACM, 1-58113-993-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
biased covering arrays, t-way interaction coverage, greedy algorithm, covering arrays, software interaction testing, mixed-level covering arrays |
40 | Rik Sarkar, Wei Zeng 0002, Jie Gao 0001, Xianfeng David Gu |
Covering space for in-network sensor data storage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPSN ![In: Proceedings of the 9th International Conference on Information Processing in Sensor Networks, IPSN 2010, April 12-16, 2010, Stockholm, Sweden, pp. 232-243, 2010, ACM, 978-1-60558-988-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Möbius transforms, Ricci flow, covering space, in-network storage, sensor networks, conformal mapping |
40 | Josue Bracho-Ríos, Jose Torres-Jimenez, Eduardo Rodriguez-Tello |
A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI ![In: MICAI 2009: Advances in Artificial Intelligence, 8th Mexican International Conference on Artificial Intelligence, Guanajuato, Mexico, November 9-13, 2009. Proceedings, pp. 397-407, 2009, Springer, 978-3-642-05257-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Software testing, Branch and Bound, Covering Arrays |
40 | Christos Koufogiannakis, Neal E. Young |
Distributed and parallel algorithms for weighted vertex cover and other covering problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 171-179, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
distributed covering, distributed vertex cover |
40 | Heeralal Janwa, Arbind K. Lal |
On Generalized Hamming Weights and the Covering Radius of Linear Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007, Proceedings, pp. 347-356, 2007, Springer, 978-3-540-77223-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Generalized Hamming weights, chain condition, generalized Griesmer bound, covering radius, cyclic codes, optimal codes, Griesmer bound |
40 | Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo |
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 147(1), pp. 23-41, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Set covering problem, Lagrangean relaxation, Multi-objective combinatorial optimization |
40 | Cemal Yilmaz 0001, Myra B. Cohen, Adam A. Porter |
Covering Arrays for Efficient Fault Characterization in Complex Configuration Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 32(1), pp. 20-34, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
fault characterization, Software testing, covering arrays, distributed continuous quality assurance |
40 | Stefan Porschen |
Algorithms for Rectangular Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I, pp. 40-49, 2006, Springer, 3-540-34070-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
rectangular covering problem, integer grid, dynamic programming, closure operator |
40 | Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez |
Effective bounding techniques for solving unate and binate covering problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 42nd Design Automation Conference, DAC 2005, San Diego, CA, USA, June 13-17, 2005, pp. 385-390, 2005, ACM, 1-59593-058-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
binate, unate, satisfiability, branch and bound, covering |
40 | Cyriel Van Nuffelen, Kristel Van Rompay |
Upper bounds on the independence and the clique covering number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 1(1), pp. 43-50, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
clique covering number, eigenvalues, adjacency matrix, independence number |
40 | Maria Axenovich, Zoltán Füredi |
Exact Bounds on the Sizes of Covering Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 30(1), pp. 21-38, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
supersaturated hypergraphs, Turán theorem, covering radius, binary codes |
40 | 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 |
40 | Stan Y. Liao, Srinivas Devadas |
Solving Covering Problems Using LPR-Based Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 34st Conference on Design Automation, Anaheim, California, USA, Anaheim Convention Center, June 9-13, 1997., pp. 117-120, 1997, ACM Press, 0-89791-920-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
integer linear programming, Covering problems |
40 | Patrick Solé, Arif Ghafoor |
A Covering Problem in the Odd Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 6th International Conference, AAECC-6, Rome, Italy, July 4-8, 1988, Proceedings, pp. 396-406, 1988, Springer, 3-540-51083-4. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
Odd Graphs, First order Reed Muller Code, Coset weight distribution, Interconnection Networks, Coding Theory, Covering Radius, Hadamard Matrices |
39 | André Bouchet |
Coverings and Delta-Coverings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 228-243, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
38 | Lu Ruan 0001, Ding-Zhu Du, Xiao-Dong Hu 0001, Xiaohua Jia, Deying Li 0001, Zheng Sun |
Converter Placement Supporting Broadcast in WDM Optical Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 50(7), pp. 750-758, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
converter placement, Color-Covering, Vertex Color-Covering, optical networks, WDM, Network optimization |
38 | Sandro Fouché, Myra B. Cohen, Adam A. Porter |
Incremental covering array failure characterization in large configuration spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSTA ![In: Proceedings of the Eighteenth International Symposium on Software Testing and Analysis, ISSTA 2009, Chicago, IL, USA, July 19-23, 2009, pp. 177-188, 2009, ACM, 978-1-60558-338-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
testing, distributed testing |
38 | Ilya Dumer |
Covering Spheres with Spheres. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 38(4), pp. 665-679, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi 0001 |
Restricted strip covering and the sensor cover problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 1056-1063, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
38 | Xunkai Wei, Ying-Hong Li 0003, Yufei Li |
Optimum Neural Network Construction Via Linear Programming Minimum Sphere Set Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, Third International Conference, ADMA 2007, Harbin, China, August 6-8, 2007, Proceedings, pp. 422-429, 2007, Springer, 978-3-540-73870-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Shu Zhao, Yanping Zhang, Ling Zhang, Ping Zhang, Ying-chun Zhang |
Probability Model of Covering Algorithm (PMCA). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (1) ![In: Intelligent Computing, International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006. Proceedings, Part I, pp. 440-444, 2006, Springer, 3-540-37271-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco |
Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(12), pp. 4378-4387, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Lisa Fleischer |
A fast approximation scheme for fractional covering problems with variable upper bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 1001-1010, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
38 | John Shawe-Taylor, Nello Cristianini |
Generalization Performance of Classifiers in Terms of Observed Covering Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroCOLT ![In: Computational Learning Theory, 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29-31, 1999, Proceedings, pp. 274-284, 1999, Springer, 3-540-65701-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Stan Y. Liao, Srinivas Devadas, Kurt Keutzer, Steven W. K. Tjiang |
Instruction selection using binate covering for code size optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1995, San Jose, California, USA, November 5-9, 1995, pp. 393-399, 1995, IEEE Computer Society / ACM, 0-8186-7213-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
code generation, digital signal processors, instruction selection |
38 | Rajeev Motwani 0001, Arvind Raghunathan, Huzur Saran |
Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988, pp. 211-223, 1988, ACM, 0-89791-270-5. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
37 | Konrad J. Swanepoel |
Simultaneous Packing and Covering in Sequence Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 42(2), pp. 335-340, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Simultaneous packing and covering constant, ? p sequence space, Closest packing, Loosest covering, Packings, Coverings |
36 | Tongjun Li, Jianmin Ma |
Fuzzy Approximation Operators Based on Coverings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSFDGrC ![In: Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, 11th International Conference, RSFDGrC 2007, Toronto, Canada, May 14-16, 2007, Proceedings, pp. 55-62, 2007, Springer, 978-3-540-72529-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Crisp coverings, fuzzy coverings, fuzzy-covering-based fuzzy rough approximation operators, fuzzy sets, fuzzy partitions |
36 | Rongquan Feng, Jin Ho Kwak |
Circulant Double Coverings of a Circulant Graph of Valency Four. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(4), pp. 385-400, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Graph covering, Voltage assignment, Cayley graph, Circulant graph |
35 | Jin Tian 0005, Minqiang Li, Fuzan Chen |
A hybrid classification algorithm based on coevolutionary EBFNN and domain covering method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 18(3), pp. 293-308, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
EBFNN, Cooperative coevolutionary algorithms, Domain covering method, Multiclass classification |
35 | Francisco de Assis Corrêa, Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena |
Hybrid heuristics for the probabilistic maximal covering location-allocation problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 7(3), pp. 323-343, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
congested systems, covering problems, Location problems, clustering search |
35 | Brahim Hnich, Steven D. Prestwich, Evgeny Selensky, Barbara M. Smith |
Constraint Models for the Covering Test Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 11(2-3), pp. 199-219, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Chanelling constraints, Modelling, Testing, Local search, Symmetry, Global constraints, Covering arrays |
35 | J. Orestes Cerdeira, Leonor Santiago Pinto |
Requiring Connectivity in the Set Covering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(1), pp. 35-47, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
integer polytopes, graphs, set covering, connected components |
35 | Hirobumi Mizuno, Iwao Sato |
Some L-Function of a Regular Covering of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(3), pp. 363-375, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
L-Function, Graph covering, Group representation, Zeta function |
35 | Cemal Yilmaz 0001, Myra B. Cohen, Adam A. Porter |
Covering arrays for efficient fault characterization in complex configuration spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSTA ![In: Proceedings of the ACM/SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2004, Boston, Massachusetts, USA, July 11-14, 2004, pp. 45-54, 2004, ACM, 1-58113-820-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
fault characterization, software testing, covering arrays, distributed continuous quality assurance |
35 | Mahesh C. Bhandari, C. Durairajan 0001 |
A Note On Covering Radius Of Macdonald Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCC ![In: 2003 International Symposium on Information Technology (ITCC 2003), 28-30 April 2003, Las Vegas, NV, USA, pp. 221-225, 2003, IEEE Computer Society, 0-7695-1916-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
MacDonald codes, Linear Codes, Covering radius, Optimal codes |
35 | Pierre-Olivier Ribet, François Vernadat 0001, Bernard Berthomieu |
On Combining the Persistent Sets Method with the Covering Steps Graph Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORTE ![In: Formal Techniques for Networked and Distributed Systems - FORTE 2002, 22nd IFIP WG 6.1 International Conference Houston, Texas, USA, November 11-14, 2002, Proceedings, pp. 344-359, 2002, Springer, 3-540-00141-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
persistent sets, covering steps graph, partial-order, Concurrent systems, state space exploration, verification methods |
35 | Tetsu Iwata, Takayuki Yoshiwara, Kaoru Kurosawa |
New Covering Radius of Reed-Muller Codes for t-Resilient Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography, 8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16-17, 2001, Revised Papers, pp. 75-86, 2001, Springer, 3-540-43066-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
t-resilient function, stream cipher, Nonlinearity, Reed-Muller code, covering radius |
35 | Y. Kaipainen, K. Suominen |
On the Covering Radius of Long 5-ary BCH Codes with Minimum Distance 7. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 8(5), pp. 403-410, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Resultant, Covering radius, BCH codes |
35 | Evguenii I. Goldberg, Luca P. Carloni, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli |
Negative thinking by incremental problem solving: application to unate covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997, pp. 91-98, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
negative thinking, discrete optimization, covering problem |
35 | Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger |
On-line and Off-line Approximation Algorithms for Vector Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings, pp. 406-418, 1996, Springer, 3-540-61680-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Approximation algorithm, on-line algorithm, covering problem, packing problem, worst case ratio |
34 | Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu |
Efficient Processing of Continual Range Queries for Location-Aware Mobile Services. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Syst. Frontiers ![In: Inf. Syst. Frontiers 7(4-5), pp. 435-448, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
mobile E-service, continual range queries, mobile computing, location-based service, query indexing, location-aware service |
34 | Chen Wu, Xibei Yang |
Information granules in general and complete coverings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GrC ![In: 2005 IEEE International Conference on Granular Computing, Beijing, China, July 25-27, 2005, pp. 675-678, 2005, IEEE, 0-7803-9017-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Igor B. Bourdonov |
Traversal of an Unknown Directed Graph by a Finite Robot. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Program. Comput. Softw. ![In: Program. Comput. Softw. 30(4), pp. 188-203, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
32 | Cevriye Gencer, Emel Kizilkaya Aydogan, Coskun Celik |
A decision support system for locating VHF/UHF radio jammer systems on the terrain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Syst. Frontiers ![In: Inf. Syst. Frontiers 10(1), pp. 111-124, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Covering location problem, Maximum covering location problem, VHF/UHF radio jammer, Decision support system |
32 | John Shunen Shieh |
Recursive morphological sieve method for searching pictorial point symbols on maps. ![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. 931-935, 1995, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
recursive morphological sieve method, pictorial point symbol searching, positional data, point symbol identification, automatic map understanding, line symbols, morphological template matching method, K-tolerance covering, symbol kernel covering, morphologically preprocessed maps, multi-level sieves, screened out symbol kernels, sieve renewal, recursive screening process, pictorial point symbol recognition, documental files, image segmentation, edge detection, maps, identification, document image processing, cartography, partial ordering method, textured regions, colored regions |
32 | Peyman Nayeri, Charles J. Colbourn, Goran Konjevod |
Randomized Postoptimization of Covering Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 408-419, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | B. K. Tripathy 0001, G. K. Panda |
On some properties of covering based approximations of classifications of sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIS ![In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS 2009), Seoul, Korea, 24-26 November 2009, pp. 1227-1232, 2009, ACM, 978-1-60558-710-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
CB - rough sets and CB - approximations of classifications, approximations of classifications, classifications, rough sets |
32 | Charles J. Colbourn, Sosina Martirosyan, Tran van Trung, Robert A. Walker |
Roux-type constructions for covering arrays of strengths three and four. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 41(1), pp. 33-57, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
AMS Classification 05B40, 68N30, 05B15 |
32 | William Zhu 0001, Fei-Yue Wang 0001 |
Properties of the First Type of Covering-Based Rough Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 18-22 December 2006, Hong Kong, China, pp. 407-411, 2006, IEEE Computer Society, 0-7695-2702-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Jun Hu 0002, Guoyin Wang 0001, Qinghua Zhang 0001 |
Uncertainty Measure of Covering Generated Rough Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IAT Workshops ![In: Proceedings of the 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology - Workshops, Hong Kong, China, 18-22 December 2006, pp. 498-504, 2006, IEEE Computer Society, 0-7695-2749-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | William Zhu 0001 |
Properties of the Second Type of Covering-Based Rough Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IAT Workshops ![In: Proceedings of the 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology - Workshops, Hong Kong, China, 18-22 December 2006, pp. 494-497, 2006, IEEE Computer Society, 0-7695-2749-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | William Zhu 0001 |
Properties of the Fourth Type of Covering-Based Rough Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HIS ![In: 6th International Conference on Hybrid Intelligent Systems (HIS 2006), 13-15 December 2006, Auckland, New Zealand, pp. 43, 2006, IEEE Computer Society, 0-7695-2662-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Michel X. Goemans, Jan Vondrák |
Stochastic Covering and Adaptivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 532-543, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Venkatesan Guruswami, Daniele Micciancio, Oded Regev 0001 |
The complexity of the covering radius problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(2), pp. 90-121, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
11H06, 11H31, 68Q25, 94B05, Subject classification. 68Q17 |
32 | Ertem Tuncel, Jayanth Nayak, Kenneth Rose |
On hierarchical type covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(12), pp. 4405-4418, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Ö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 |
32 | Niv Buchbinder, Joseph Naor |
Online Primal-Dual Algorithms for Covering and Packing Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 689-701, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Gao Cong, Kian-Lee Tan, Anthony K. H. Tung, Xin Xu |
Mining Top-k Covering Rule Groups for Gene Expression Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Baltimore, Maryland, USA, June 14-16, 2005, pp. 670-681, 2005, ACM, 1-59593-060-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Michel X. Goemans, Jan Vondrák |
Covering minimum spanning trees of random subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 934-941, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
32 | Venkatesan Guruswami, Daniele Micciancio, Oded Regev 0001 |
The Complexity of the Covering Radius Problem on Lattices and Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA, pp. 161-173, 2004, IEEE Computer Society, 0-7695-2120-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
32 | Vasco M. Manquinho, João Marques-Silva 0001 |
On Using Satisfiability-Based Pruning Techniques in Covering Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2000 Design, Automation and Test in Europe (DATE 2000), 27-30 March 2000, Paris, France, pp. 356-363, 2000, IEEE Computer Society / ACM, 0-7695-0537-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
32 | Patrick Solé |
Covering Codes and Combinatorial Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991, Proceedings, pp. 426-433, 1991, Springer, 3-540-54522-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
32 | Ravi Kannan, László Lovász 0001 |
Covering Minima and Lattice Point Free Convex Bodies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings, pp. 193-213, 1986, Springer, 3-540-17179-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
31 | Juriaan Simonis |
Covering Radius: Improving on the Sphere-Covering Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 6th International Conference, AAECC-6, Rome, Italy, July 4-8, 1988, Proceedings, pp. 377-385, 1988, Springer, 3-540-51083-4. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
30 | Philippe Langevin, Jean-Pierre Zanotti |
Nonlinearity of Some Invariant Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 36(2), pp. 131-146, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
cryptography, boolean functions, Fourier transforms, nonlinearity, characters, Reed-Muller codes, covering radius, finite groups |
Displaying result #1 - #100 of 6702 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|