|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 22091 occurrences of 8614 keywords
|
|
|
Results
Found 30405 publication records. Showing 30405 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
14 | Tadeusz Litak, Frank Wolter |
All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 81(2), pp. 153-165, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
frame incompleteness, computational complexity, temporal logic, NP-completeness, tense logic |
14 | Jinyan Li 0001, Haiquan Li, Donny Soh, Limsoon Wong |
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Knowledge Discovery in Databases: PKDD 2005, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal, October 3-7, 2005, Proceedings, pp. 146-156, 2005, Springer, 3-540-29244-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
14 | Ferenc Bodon, Lars Schmidt-Thieme |
The Relation of Closed Itemset Mining, Complete Pruning Strategies and Item Ordering in Apriori-Based FIM Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Knowledge Discovery in Databases: PKDD 2005, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal, October 3-7, 2005, Proceedings, pp. 437-444, 2005, Springer, 3-540-29244-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
14 | Zu-Guo Yu, Vo Anh, Li-Quan Zhou |
Fractal and Dynamical Language Methods to Construct Phylogenetic Tree Based on Protein Sequences from Complete Genomes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNC (3) ![In: Advances in Natural Computation, First International Conference, ICNC 2005, Changsha, China, August 27-29, 2005, Proceedings, Part III, pp. 337-347, 2005, Springer, 3-540-28320-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
14 | Ian P. Gent, Andrew G. D. Rowley |
Local and Global Complete Solution Learning Methods for QBF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings, pp. 91-106, 2005, Springer, 3-540-26276-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
14 | Björn Vormbrock |
Complete Subalgebras of Semiconcept Algebras and Protoconcept Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFCA ![In: Formal Concept Analysis, Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings, pp. 329-343, 2005, Springer, 3-540-24525-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
14 | Jan Kyncl, Pavel Valtr 0001 |
On Edges Crossing Few Other Edges in Simple Topological Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, pp. 274-284, 2005, Springer, 3-540-31425-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
14 | Nathaniel Ayewah, Nikhil Kikkeri, Peter-Michael Seidel |
Challenges in the Formal Verification of Complete State-of-the-Art Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 23rd International Conference on Computer Design (ICCD 2005), 2-5 October 2005, San Jose, CA, USA, pp. 603-608, 2005, IEEE Computer Society, 0-7695-2451-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
14 | Fei Tony Liu, Kai Ming Ting, Wei Fan 0001 |
Maximizing Tree Diversity by Building Complete-Random Decision Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference, PAKDD 2005, Hanoi, Vietnam, May 18-20, 2005, Proceedings, pp. 605-610, 2005, Springer, 3-540-26076-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
14 | Delphine Boucher |
Non complete integrability of a magnetic satellite in circular orbit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 53-60, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
14 | 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 |
|
14 | Haixing Zhao, Xueliang Li 0001, Ruying Liu, Chengfu Ye |
The Chromaticity of Certain Complete Multipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(3), pp. 423-434, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Chromatic uniqueness, Adjoint polynomial, Adjoint uniqueness |
14 | Spencer K. L. Fung, Denny J. Zheng, Ho-fung Leung, Jimmy Ho-Man Lee, Hon Wai Chun |
A Framework for Guided Complete Search for Solving Constraint Satisfaction Problems and Some of Its Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 15-17 November 2004, Boca Raton, FL, USA, pp. 696-703, 2004, IEEE Computer Society, 0-7695-2236-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
14 | Angela Aguglia, Antonio Cossidente, Gary L. Ebert |
Complete Spans on Hermitian Varieties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 29(1-3), pp. 7-15, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
14 | János Pach, József Solymosi, Géza Tóth 0001 |
Unavoidable Configurations in Complete Topological Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 30(2), pp. 311-320, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
14 | Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, pp. 429-438, 2003, Springer, 3-540-40671-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
concurrency, Temporal logics, Mazurkiewicz traces |
14 | Arun N. Netravali, Krishan K. Sabnani, Ramesh Viswanathan |
Correct Passive Testing Algorithms and Complete Fault Coverage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORTE ![In: Formal Techniques for Networked and Distributed Systems - FORTE 2003, 23rd IFIP WG 6.1 International Conference, Berlin, Germany, September 29 - October 2, 2003, Proceedings, pp. 303-318, 2003, Springer, 3-540-20175-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
14 | William Hesse, Neil Immerman |
Complete Problems for Dynamic Complexity Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings, pp. 313-, 2002, IEEE Computer Society, 0-7695-1483-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
14 | G. S. Lehal, Chandan Singh |
A Complete OCR System for Gurmukhi Script. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSPR/SPR ![In: Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshops SSPR 2002 and SPR 2002, Windsor, Ontario, Canada, August 6-9, 2002, Proceedings, pp. 358-367, 2002, Springer, 3-540-44011-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
14 | Holger Meuss, Klaus U. Schulz |
Complete answer aggregates for treelike databases: a novel approach to combine querying and navigation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Inf. Syst. ![In: ACM Trans. Inf. Syst. 19(2), pp. 161-215, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
answer presentation, tree databases, tree matching, XML, XML, information retrieval, query languages, logic, SGML, SGML, semistructured data, structured documents |
14 | Timothy S. Gegg-Harrison |
Ancient Egyptian numbers: a CS-complete example. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 32rd SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2001, Charlotte, North Carolina, USA, 2001, pp. 268-272, 2001, ACM, 1-58113-329-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Peter K. K. Loh, Heiko Schröder, Wen-Jing Hsu |
Fault-Tolerant Routing on Complete Josephus Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSAC ![In: 6th Australasian Computer Systems Architecture Conference (ACSAC 2001), 29-30 January 2001, Gold Coast, Queensland, Australia, pp. 95-104, 2001, IEEE Computer Society, 0-7695-0954-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Samson Abramsky, Marina Lenisa |
Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 443-457, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Atsushi Kaneko, Mikio Kano |
On Paths in a Complete Bipartite Geometric Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers, pp. 187-191, 2000, Springer, 3-540-42306-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
14 | János Pach, Géza Tóth 0001 |
Unavoidable Configurations in Complete Topological Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings, pp. 328-337, 2000, Springer, 3-540-41554-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
14 | Sang Kyu Lee, Ju-Young Lee Park |
Contention Free Embedding of Complete Binary Trees into 3D Meshes in Half and Full-Duplexed Network Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: Proceedings of the International Conference on Parallel Processing 1999, ICPP 1999, Wakamatsu, Japan, September 21-24, 1999, pp. 266-273, 1999, IEEE Computer Society, 0-7695-0350-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
parallel processing, interconnection network, embedding |
14 | David R. Musser, Arturo J. Sánchez-Ruíz |
Theory and Generality of Complete Traversals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Generic Programming ![In: Generic Programming, International Seminar on Generic Programming, Dagstuhl Castle, Germany, April 27 - May 1, 1998, Selected Papers, pp. 91-101, 1998, Springer, 3-540-41090-2. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Standard Template Library (STL), Adaptors, Iteration Mechanisms, Generic Programming, Iterators, Containers, Closures |
14 | François Bry, Sunna Torge 0001 |
A Deduction Method Complete for Refutation and Finite Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence, European Workshop, JELIA '98, Dagstuhl, Germany, October 12-15, 1998, Proceedings, pp. 122-138, 1998, Springer, 3-540-65141-1. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
14 | Didier Dubois, Henri Prade |
Valid or Complete Information in Databases - A Possibility Theory-Based Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA ![In: Database and Expert Systems Applications, 8th International Conference, DEXA '97, Toulouse, France, September 1-5, 1997, Proceedings, pp. 603-612, 1997, Springer, 3-540-63478-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Ingbert Kupka |
Unique Fixpoints in Complete Lattices with Applications to Formal Languages and Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Foundations of Computer Science: Potential - Theory - Cognition ![In: Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday, pp. 107-115, 1997, Springer, 3-540-63746-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
14 | Adrienne L. Broadwater, Kemal Efe, Antonio Fernández 0001 |
Embedding Complete Binary Trees in Product Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 56-66, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
14 | Stavros S. Cosmadakis |
Complete Proof Systems for Algebraic Simply-Typed Terms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LISP and Functional Programming ![In: Proceedings of the 1994 ACM Conference on LISP and Functional Programming, Orlando, Florida, USA, 27-29 June 1994., pp. 220-226, 1994, ACM, 0-89791-643-3. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
14 | Pavol Duris, José D. P. Rolim |
E-Complete Sets Do Not Have Optimal Polynomial Time Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings, pp. 38-51, 1994, Springer, 3-540-58338-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
14 | Sreejit Chakravarty, S. S. Ravi |
Computing optimal test sequences from complete test sets for stuck-open faults in CMOS circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(3), pp. 329-331, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
14 | Zhugou Mo, Kenneth Williams 0001 |
Algorithms on Block-Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Computer Science Conference ![In: Computing in the 90's, The First Great Lakes Computer Science Conference, Kalamazzo, Michigan, USA, October 18-20, 1989, Proceedings, pp. 34-40, 1989, Springer, 3-540-97628-0. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
14 | Toshimitsu Masuzawa, Naoki Nishikawa, Kenichi Hagihara, Nobuki Tokura |
Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 3rd International Workshop, Nice, France, September 26-28, 1989, Proceedings, pp. 171-182, 1989, Springer, 3-540-51687-5. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
14 | Maria J. Serna, Paul G. Spirakis |
The Approximability of Problems Complete for P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optimal Algorithms ![In: Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29 - June 2, 1989, Proceedings, pp. 193-204, 1989, Springer, 3-540-51859-2. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
14 | Timothy B. Baird, Gerald E. Peterson, Ralph W. Wilkerson |
Complete Sets of Reductions Modulo Associativity, Commutativity and Identity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings, pp. 29-44, 1989, Springer, 3-540-51081-8. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
14 | Weishing Chen, S. Sitharama Iyengar |
A complete binary tree based system for activation of concurrent processes (abstract only). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 13th ACM Annual Conference on Computer Science, New Orleans, Louisiana, USA, 1985, pp. 418, 1985, ACM, 0-89791-150-4. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
14 | Burkhard Monien |
Bounding the Bandwidth of NP-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG '80, Bad Honnef, Germany, June 15-18, 1980, pp. 279-292, 1980, Springer, 3-540-10291-4. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
13 | Jana Maxová, Pavla Pavlíková, Daniel Turzík |
On the Complexity of Cover-Incomparability Graphs of Posets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 26(3), pp. 229-236, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Transitive orientation, Graph, NP-complete, Poset |
13 | Georg Gottlob, Zoltán Miklós 0001, Thomas Schwentick |
Generalized hypertree decompositions: NP-hardness and tractable variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 56(6), pp. 30:1-30:32, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
TreeProjection Problem, hypertree decomposition, NP-complete, hypergraph, Conjunctive query, tractable, acyclic |
13 | Ashish Sabharwal |
SymChaff: exploiting symmetry in a structure-aware satisfiability solver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 14(4), pp. 478-505, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
SymChaff, Complete multi-class symmetry, Global symmetry, High-level representation, Planning, SAT, Boolean satisfiability |
13 | Mihai Oltean, Oana Muntean |
Solving the subset-sum problem with a light-based device. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Comput. ![In: Nat. Comput. 8(2), pp. 321-331, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Optical solutions, NP-complete, Unconventional computing, Subset sum |
13 | Gang Fang, Jin Xu, Shemin Zhang |
Performing DNA computation with RecA-mediated triple-stranded DNA structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Comput. ![In: Nat. Comput. 8(1), pp. 149-156, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
RecA protein, Satisfiability problem (SAT), Triple-stranded DNA structure, DNA computing, NP-complete problems |
13 | David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf |
Approximate topological matching of quad meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 25(8), pp. 771-783, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Topological matching, Lazy-greedy heuristic, NP-complete, NP-hard, Isomorphism, Quad mesh |
13 | Mihai Oltean, Oana Muntean |
Evolutionary Design of Graph-Based Structures for Optical Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OSC ![In: Optical SuperComputing, Second International Workshop, OSC 2009, Bertinoro, Italy, November 18-20, 2009. Proceedings, pp. 56-69, 2009, Springer, 978-3-642-10441-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
evolutionary algorithms, genetic programming, NP-complete, optical computing, unconventional computing |
13 | Roberto Lublinerman, Christian Szegedy, Stavros Tripakis |
Modular code generation from synchronous block diagrams: modularity vs. code size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009, pp. 78-89, 2009, ACM, 978-1-60558-379-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
clustering, code generation, np-complete, embedded software, synchronous languages, block diagrams |
13 | Sadaaki Miyamoto |
Refinement Properties in Agglomerative Hierarchical Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MDAI ![In: Modeling Decisions for Artificial Intelligence, 6th International Conference, MDAI 2009, Awaji Island, Japan, November 30-December 2, 2009. Proceedings, pp. 259-267, 2009, Springer, 978-3-642-04819-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
single linkage, complete linkage, average linkage, refinement, Agglomerative clustering |
13 | Shiyan Hu, Zhuo Li 0001, Charles J. Alpert |
A faster approximation scheme for timing driven minimum cost layer assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2009 International Symposium on Physical Design, ISPD 2009, San Diego, California, USA, March 29 - April 1, 2009, pp. 167-174, 2009, ACM, 978-1-60558-449-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
dynamic programming, np-complete, oracle, fully polynomial time approximation scheme, layer assignment |
13 | A. C. Ramachandra, K. Pavithra, K. Yashasvini, K. B. Raja, K. R. Venugopal 0001, Lalit M. Patnaik |
Offline signature authentication using cross-validated graph matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bangalore Compute Conf. ![In: Proceedings of the 2nd Bangalore Annual Compute Conference, Compute 2009, Bangalore, India, January 9-10, 2009, pp. 7, 2009, ACM, 978-1-60558-476-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
complete matching, equal error rate, offline signature verification, biometrics, bipartite graph, cross-validation |
13 | Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Joice Punitha |
Kernel in Oriented Circulant Graphs. ![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. 396-407, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
oriented graph, strong kernel number, strongly connected, NP-complete, kernel |
13 | Qi Cheng 0001, Daqing Wan |
A deterministic reduction for the gap minimum distance problem: [extended abstract]. ![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. 33-38, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
minimum distance problem, approximation algorithm, NP-complete, coding theory |
13 | Shiyan Hu, Zhuo Li 0001, Charles J. Alpert |
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 46th Design Automation Conference, DAC 2009, San Francisco, CA, USA, July 26-31, 2009, pp. 424-429, 2009, ACM, 978-1-60558-497-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
dynamic programming, NP-complete, buffer insertion, fully polynomial time approximation scheme, cost minimization |
13 | T. L. Alderson, Aiden A. Bruen |
Maximal AMDS codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 19(2), pp. 87-98, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
NMDS codes, AMDS codes, (n, r)-arcs, Cubic curves, Complete arcs, Code extension, Arcs |
13 | Qun Zhao, Mohan Gurusamy |
Lifetime maximization for connected target coverage in wireless sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 16(6), pp. 1378-1391, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
sensor activity scheduling, wireless sensor networks, approximation algorithms, NP-complete, coverage, network lifetime |
13 | William B. Langdon, Riccardo Poli |
Mapping non-conventional extensions of genetic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Comput. ![In: Nat. Comput. 7(1), pp. 21-43, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Markov analysis of program search spaces, Any time computation, Entropy and irreversible loss of information, Program convergence, Halting probability genetic algorithms, Genetic programming, Turing complete, Program termination |
13 | Robert W. Irving |
Stable matching problems with exchange restrictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(4), pp. 344-360, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Matching, NP-complete problems, Stable marriage |
13 | Sujit Kumar Chakrabarti, Y. N. Srikant |
Test sequence computation for regression testing of reactive systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISEC ![In: Proceeding of the 1st Annual India Software Engineering Conference, ISEC 2008, Hyderabad, India, February 19-22, 2008, pp. 131-132, 2008, ACM, 978-1-59593-917-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
NP-complete, regression testing, API, test sequence, test specification |
13 | Dezun Dong, Yunhao Liu 0001, Xiangke Liao |
Self-monitoring for sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008, pp. 431-440, 2008, ACM, 978-1-60558-073-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
security, wireless sensor network, np-complete, self-monitoring |
13 | Andrea Frosini, Christophe Picouleau, Simone Rinaldi |
Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 14th IAPR International Conference, DGCI 2008, Lyon, France, April 16-18, 2008. Proceedings, pp. 392-400, 2008, Springer, 978-3-540-79125-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
polynomial time reduction, NP- complete Problem, Discrete Tomography |
13 | Johannes Wollbold, Reinhard Guthke, Bernhard Ganter |
Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AB ![In: Algebraic Biology, Third International Conference, AB 2008, Castle of Hagenberg, Austria, July 31-August 2, 2008, Proceedings, pp. 230-244, 2008, Springer, 978-3-540-85100-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
temporal logic, reasoning, gene expression, Complete lattices |
13 | Alexandre Monteiro da Silva, Peter Sussner |
A Brief Review and Comparison of Feedforward Morphological Neural Networks with Applications to Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICANN (2) ![In: Artificial Neural Networks - ICANN 2008, 18th International Conference, Prague, Czech Republic, September 3-6, 2008, Proceedings, Part II, pp. 783-792, 2008, Springer, 978-3-540-87558-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematical Morphology, Pattern Classification, Complete Lattice, Morphological Neural Network |
13 | H. Mohebi 0001, Eskandar Naraghirad |
Closed convex sets and their best simultaneous approximation properties with applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 1(4), pp. 313-328, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Simultaneous best approximation, Simultaneous pseudo-Chebyshev set, Simultaneous quasi-Chebyshev set, Conditionally complete lattice Banach space, Extremal point |
13 | Luca Allulli, Roberto Baldoni, Luigi Laura, Sara Tucci Piergiovanni |
On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 56(6), pp. 853-858, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Z-cycles, progressive retry, online versus offline analysis, Distributed computing, checkpointing, competitive analysis, NP-complete problem |
13 | Chao-Chih Chou, Chin-Mei Fu |
Decomposition of K m , n into 4-cycles and 2 t -cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(2-3), pp. 205-218, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Complete bipartite graph, Cycle decomposition |
13 | Ying-Da Chen, Jing-Ho Yan |
A study on cyclic bandwidth sum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(2-3), pp. 295-308, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Proper labeling, Cyclic bandwidth sum, Complete bipartite graph, Cyclic displacement, Zero cycle, Extended labeling, Balanced 2-color, Tree |
13 | Boting Yang, Yi Cao |
Monotonicity of strong searching on digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(4), pp. 411-425, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Cops-and-robber game, Pursuit-and-evasion problem, NP-complete, Monotonicity, Graph searching, Digraph |
13 | Lothrop Mittenthal |
Sequencings and Directed Graphs with Applications to Cryptography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSC ![In: Sequences, Subsequences, and Consequences, International Workshop, SSC 2007, Los Angeles, CA, USA, May 31 - June 2, 2007, Revised Invited Papers, pp. 70-81, 2007, Springer, 978-3-540-77403-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Block encryption, Complete Latin square, Directed terrace, Inter-round mixing, Quick trickle permutation, Sequenceable group, S/P network, Directed graph, Sequencing |
13 | Wolfgang Bziuk |
Uniform Approximations for Multirate Loss Systems with State Dependent Arrival Rates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITC ![In: Managing Traffic Performance in Converged Networks, 20th International Teletraffic Congress, ITC20 2007, Ottawa, Canada, June 17-21, 2007, Proceedings, pp. 754-766, 2007, Springer, 978-3-540-72989-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Multirate Loss System, Complete Sharing, State Dependent Arrival Rates, Uniform Approximation |
13 | Olga Goussevskaia, Yvonne Anne Oswald, Roger Wattenhofer |
Complexity in geometric SINR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2007, Montreal, Quebec, Canada, September 9-14, 2007, pp. 100-109, 2007, ACM, 978-1-59593-684-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
geometric SINR, weighted scheduling, scheduling, ad-Hoc networks, approximation algorithms, wireless, NP-complete, SINR |
13 | Zareen Alamgir, Sarmad Abbasi |
Combinatorial Algorithms for Listing Paths in Minimal Change Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAN ![In: Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers, pp. 112-130, 2007, Springer, 978-3-540-77293-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Minimal change order, Revolving door order, Generation of paths, Combinatorial algorithms, Complete graph |
13 | Qi Cheng 0001, Elizabeth Murray |
On Deciding Deep Holes of Reed-Solomon Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 296-305, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
deep hole, NP-complete, Reed-Solomon codes, algebraic surface |
13 | Christopher Ostler, Karam S. Chatha, Goran Konjevod |
Approximation Algorithm for Process Mapping on Network Processor Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of the 12th Conference on Asia South Pacific Design Automation, ASP-DAC 2007, Yokohama, Japan, January 23-26, 2007, pp. 577-582, 2007, IEEE Computer Society, 1-4244-0629-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Intel IXP2400 architecture, programmable network processor architectures, symmetric multiprocessing, automated system-level design, NP-complete problem, process mapping, polynomial time approximation algorithm, block multithreading |
13 | Nan Yang, Songxiang Lin, Qiang Gao |
An Exhaustive and Edge-Removal Algorithm to Find Cores in Implicit Communities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb/WAIM ![In: Advances in Data and Web Management, Joint 9th Asia-Pacific Web Conference, APWeb 2007, and 8th International Conference, on Web-Age Information Management, WAIM 2007, Huang Shan, China, June 16-18, 2007, Proceedings, pp. 273-280, 2007, Springer, 978-3-540-72483-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Complete Bipartite Graph, Link analysis, Web communities |
13 | Paul S. Bonsma, Luis Cereceda |
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 738-749, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
vertex-recolouring, colour graph, superpolynomial distance, PSPACE-complete |
13 | Changjiang Zhang, Han Wei |
Contrast Enhancement for Image by WNN and GA Combining PSNR with Information Entropy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFIE ![In: Fuzzy Information and Engineering, Proceedings of the Second International Conference of Fuzzy Information and Engineering, ICFIE 2007, May 13-16, 2007, Guangzhou, China, pp. 3-15, 2007, Springer, 978-3-540-71440-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
discrete stationary wavelet transform, in-complete Beta transform, genetic algorithm, wavelet neural network, contrast enhancement |
13 | Branimir Seselja, Andreja Tepavcevic |
Fuzzifying Closure Systems and Fuzzy Lattices. ![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. 111-118, 2007, Springer, 978-3-540-72529-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
fuzzifying closure system, fuzzy complete lattice, lattice ordered fuzzy poset, fuzzy lattice |
13 | Georg Gottlob, Zoltán Miklós 0001, Thomas Schwentick |
Generalized hypertree decompositions: np-hardness and tractable variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China, pp. 13-22, 2007, ACM, 978-1-59593-685-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hypertree decomposition, tree projection problem, NP-complete, hypergraph, conjunctive query, tractable, acyclic |
13 | G. Hosein Mohimani, Massoud Babaie-Zadeh, Christian Jutten |
Fast Sparse Representation Based on Smoothed l0 Norm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA ![In: Independent Component Analysis and Signal Separation, 7th International Conference, ICA 2007, London, UK, September 9-12, 2007., pp. 389-396, 2007, Springer, 978-3-540-74493-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
over-complete atomic decomposition, sparse component analysis |
13 | Zhixiang Yin, Jianzhong Cui, Jin Yang |
A Surface-Based DNA Computing for the Positive Integer Linear Programming Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (1) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues, Third International Conference on Intelligent Computing, ICIC 2007, Qingdao, China, August 21-24, 2007, Proceedings, pp. 1-9, 2007, Springer, 978-3-540-74170-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
0-1 Programming Problem, Integer linear programming, DNA Computing, NP-Complete Problem |
13 | Zhimin Yuan, Zhiguo Zhang |
Asynchronous Spiking Neural P System with Promoters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPT ![In: Advanced Parallel Processing Technologies, 7th International Symposium, APPT 2007, Guangzhou, China, November 22-23, 2007, Proceedings, pp. 693-702, 2007, Springer, 978-3-540-76836-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Asynchronous P System, Parallel Computing, Membrane Computing, Molecular Computing, P System, Turing Complete |
13 | Wei Meng, Shengjia Li |
Semicomplete Multipartite Digraphs Whose Every Arc Is Contained in a Hamiltonian Path. ![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. 299-304, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Semicomplete multipartite digraph, Semi-partition complete digraphs, Hamiltonian paths |
13 | Wickus Nienaber, Xin Yuan 0001, Zhenhai Duan |
On LID assignment in infiniBand networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANCS ![In: Proceedings of the 2007 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, ANCS 2007, Orlando, Florida, USA, December 3-4, 2007, pp. 97-106, 2007, ACM, 978-1-59593-945-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
LID assignment, np-complete, infiniBand |
13 | Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood |
A Fixed-Parameter Approach to 2-Layer Planarization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 45(2), pp. 159-182, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Sugiyama approach, NP-complete, Graph algorithms, Graph drawing, Planarization, Fixed-parameter tractability, Crossing minimization |
13 | M. G. Karunambigai, Appu Muthusamy |
On Resolvable Multipartite G-Designs II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(1), pp. 59-67, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Cycle-factorization, Wreath product of graphs, Complete symmetric k?partite multi-digraph, Resolvable multipartite G -design |
13 | Wei Liu 0008, Yanchao Zhang, Yuguang Fang, Kejie Lu |
Energy conservation through resource-aware movement in heterogeneous mobile ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(1), pp. 7-20, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Heterogeneous mobile ad hoc networks, Mobility, NP-Complete, Energy conservation, Resource-aware |
13 | Gintaras Palubeckis |
A Tight Lower Bound for a Special Case of Quadratic 0-1 Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 77(2), pp. 131-145, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Binary quadratic optimization, graph, NP-complete |
13 | Loris Marchal, Pascale Vicat-Blanc Primet, Yves Robert, Jingdi Zeng |
Optimal Bandwidth Sharing in Grid Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPDC ![In: Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15, Paris, France, June 19-23, 2006, pp. 144-155, 2006, IEEE, 1-4244-0307-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
optimal network bandwidth sharing strategy, storage resource, grid network resource management, transmission window, grid computing, high-performance computing, NP-complete, distributed environment, data transfer, resource utilization, grid environment, traffic pattern |
13 | Joachim Biskup, Piero A. Bonatti |
Controlled Query Evaluation with Open Queries for a Decidable Relational Submodel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoIKS ![In: Foundations of Information and Knowledge Systems, 4th International Symposium, FoIKS 2006, Budapest, Hungary, February 14-17, 2006, Proceedings, pp. 43-62, 2006, Springer, 3-540-31782-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Complete information system, Open query, Safe query, Domain-independent query, Bernays-Schönfinkel class, Completeness test, Relational database, Confidentiality, First-order logic, Finite model theory, Guarded fragment, Lying, Refusal, Implication problem, Controlled query evaluation |
13 | Jing Wu, Guo-Chang Gu |
RealTime-BestPoint-Based Compiler Optimization Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb Workshops ![In: Advanced Web and Network Technologies, and Applications, APWeb 2006 International Workshops: XRA, IWSN, MEGA, and ICSE, Harbin, China, January 16-18, 2006, Proceedings, pp. 767-774, 2006, Springer, 3-540-31158-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Real-time best-point, live-vertex, semilive-vertex, complete semilive-vertex |
13 | Wu Jigang, Thambipillai Srikanthan |
Power Efficient Sub-Array in Reconfigurable VLSI Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 20(5), pp. 647-653, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
degradable VLSI mesh, fault-tolerance, reconfiguration, NP-complete, heuristic algorithm |
13 | Philippe Chapdelaine, Nadia Creignou |
The complexity of Boolean constraint satisfaction local search problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 43(1), pp. 51-63, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
PLS-complete, optimization, complexity, local search, satisfiability, PLS |
13 | Xueyan Tang, Jianliang Xu |
QoS-Aware Replica Placement for Content Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(10), pp. 921-932, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
quality of service, dynamic programming, replication, NP-complete, placement, Content distribution |
13 | Sing-Ling Lee, Hann-Jang Ho |
A 1.5 Approximation Algorithm for Embedding Hyperedges in a Cycle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(6), pp. 481-488, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithm, NP-complete, integer linear programming, hypergraph, LP-relaxation |
13 | Jérôme Monnot |
On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 934-943, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
labeled matching, approximate algorithms, NP-complete, bipartite graphs, colored matching |
13 | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Coloring: Further Complexity and Approximability Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings, pp. 205-214, 2005, Springer, 3-540-29106-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
weighted coloring, line graph of bipartite graphs, Approximation algorithm, NP-complete problems, interval graphs, partial k-tree |
13 | Bernhard Ganter, Léonard Kwuida |
Which Concept Lattices Are Pseudocomplemented?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFCA ![In: Formal Concept Analysis, Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings, pp. 408-416, 2005, Springer, 3-540-24525-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
pseudocomplement, arrow-relation, complete homomorphism, lattices, Formal Concept Analysis, closure operator |
13 | Christos Kravvaritis, Marilena Mitrouli, Jennifer Seberry |
Counting Techniques Specifying the Existence of Submatrices in Weighing Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, Kalamata, Greece, September 12-16, 2005, Proceedings, pp. 294-305, 2005, Springer, 3-540-28966-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
complete pivoting, weighing matrices, symbolic computation, Gaussian elimination, growth |
13 | Sergey P. Tsarev |
Generalized laplace transformations and integration of hyperbolic systems of linear partial differential equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 325-331, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
complete solutions, systems of linear PDEs, factorization |
Displaying result #401 - #500 of 30405 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|