|
|
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 |
23 | M. Vojdani Tabatabaee, M. Mehdi Ebrahimi |
Metric and Complete Metric sigma-Frames. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 11(2), pp. 135-146, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
cozero set, metric -frame, metric Lindelöf frame, complete -frame, frame |
23 | Sudhanva Gurumurthi, Anand Sivasubramaniam, Mary Jane Irwin, Narayanan Vijaykrishnan, Mahmut T. Kandemir, Tao Li 0006, Lizy Kurian John |
Using Complete Machine Simulation for Software Power Estimation: The SoftWatt Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCA ![In: Proceedings of the Eighth International Symposium on High-Performance Computer Architecture (HPCA'02), Boston, Massachusettes, USA, February 2-6, 2002, pp. 141-150, 2002, IEEE Computer Society, 0-7695-1525-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Complete Machine Simulation, SimOS, Power Simulation, Operating System, Power Consumption |
23 | Frantisek Machala |
Join-Independent and Meet-Independent Sets in Complete Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 18(3), pp. 269-274, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
independent sets, complete lattices |
23 | N. S. Sundar, Doddaballapur Narasimha-Murthy Jayasimha, Dhabaleswar K. Panda 0001 |
Hybrid Algorithms for Complete Exchange in 2D Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 12(12), pp. 1201-1218, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
direct exchange, message contention, wormhole routing, Collective communication, hybrid algorithms, combining, barrier synchronization, complete exchange, mesh topology |
23 | Pranav Ashar, Aarti Gupta, Sharad Malik |
Using complete-1-distinguishability for FSM equivalence checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 6(4), pp. 569-590, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Bisimulation relation, complete-1-distinguishability, finite state machine equivalence, sequential logic synthesis, equivalence checking |
23 | SungSa Hong, YoungKyoung Kim |
Cauchy Complete Nearness Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 8(1-2), pp. 271-277, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
nearness spaces, regular Cauchy filters, Cauchy complete nearness spaces, Cauchy completions of nearness spaces, Cauchy maps |
23 | Marilena Mitrouli |
On the Complete Pivoting Conjecture for Hadamard Matrices of Order 16. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NAA ![In: Numerical Analysis and Its Applications, Second International Conference, NAA 2000, Rousse, Bulgaria, June 11-15, 2000, Revised Papers, pp. 602-607, 2000, Springer, 3-540-41814-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
pivot size, complete pivoting, Hadamard matrices AMS Subject Classification: 65F05, 65G05, Gaussian elimination, 05B20 |
23 | Huan-Chao Keh, Jen-Chih Lin |
Simulation of Complete Binary Tree Structures in a Faulty Flexible Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sci. Comput. ![In: J. Sci. Comput. 14(3), pp. 245-258, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Flexible hypercube, embedding, complete binary tree |
23 | Sang Kyu Lee, Hyeong-Ah Choi |
Embedding of Complete Binary Trees into Meshes with Row-Column Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 7(5), pp. 493-497, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
row-column routing, link congestion, Embedding, mesh, complete binary tree |
23 | Karl M. Fant, Scott A. Brandt |
NULL Convention LogicTM: A Complete And Consistent Logic For Asynchronous Digital Circuit Synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASAP ![In: 1996 International Conference on Application-Specific Systems, Architectures, and Processors (ASAP '96), August 19-23, 1996, Chicago, IL , USA, pp. 261-273, 1996, IEEE Computer Society, 0-8186-7542-X. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
consistent logic, asynchronous digital circuit synthesis, symbolically complete logic, asynchronous digital circuits, asynchronous circuits, multivalued logic, three value logic, Boolean logic, NULL Convention Logic, four value logic |
23 | Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau |
Embeddings of complete binary trees into star graphs with congestion 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 546-554, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
complete binary tree embeddings, vertex congestion, graph height, binary tree architecture, parallel architectures, multiprocessor interconnection networks, trees (mathematics), dilation, star graphs, algorithm simulation |
23 | Abdel Aziz Farrag, Robert J. Dawson |
The Fault-Tolerant Extension Problem for Complete Multipartite Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(2), pp. 205-210, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
fault-tolerant extension problem, complete multipartite networks, search time, fault tolerant computing, combinatorial problem |
23 | Etienne Grandjean, Frédéric Olive |
Monadic Logical Definability of NP-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers, pp. 190-204, 1994, Springer, 3-540-60017-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Computational complexity, NP-complete problem, nondeterminism, finite model theory, monadic second-order logic, linear time, random access machine |
22 | George E. Strecker |
Flows With Respect to a Functor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 8(3), pp. 559-578, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
(E,M)-functor, coadjoint functor, wolf, strongly complete, extremally complete, completeness, factorization, flow |
22 | Sreejit Chakravarty, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz |
The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(6), pp. 865-869, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
minimum test sets, monotone combinational circuits, minimum complete test set, monotone PLAs, computational complexity, complexity, logic testing, NP-complete, logic arrays, combinatorial circuits, literals |
22 | Severino Villanueva Gervacio |
Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCCGGT ![In: Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers, pp. 94-101, 2003, Springer, 3-540-24401-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani |
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADHOC-NOW ![In: Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, ADHOC-NOW 2009, Murcia, Spain, September 22-25, 2009, Proceedings, pp. 194-212, 2009, Springer, 978-3-642-04382-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Intruder, Optimal Movement, Sensors, NP-complete, Coverage, Detection, PTAS, Barrier, Line Segment |
22 | Sama Goliaei, Saeed Jalili |
An Optical Wavelength-Based Solution to the 3-SAT Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OSC ![In: Optical SuperComputing, Second International Workshop, OSC 2009, Bertinoro, Italy, November 18-20, 2009. Proceedings, pp. 77-85, 2009, Springer, 978-3-642-10441-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Wavelength-Based Approach, 3-SAT Problem, NP- Complete, Optical Computing, Unconventional Computing |
21 | Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Autoreducibility, Mitoticity, and Immunity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 387-398, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Mike Reed |
Order, Topology, and Recursion Induction in CSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
25 Years Communicating Sequential Processes ![In: Communicating Sequential Processes: The First 25 Years, Symposium on the Occasion of 25 Years of CSP, London, UK, July 7-8, 2004, Revised Invited Papers, pp. 242-242, 2004, Springer, 3-540-25813-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Harry Buhrman, Leen Torenvliet |
Separating Complexity Classes Using Structural Properties. ![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. 130-138, 2004, IEEE Computer Society, 0-7695-2120-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Burkhard Monien, Ivan Hal Sudborough |
Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings, pp. 78-93, 1981, Springer, 3-540-10856-4. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
21 | Sanatan Rai, George L. Vairaktarakis |
NP-complete Problems and Proof Methodology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2675-2682, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Polynomial time reduction, strong NP-completeness, ordinary NP-completeness, Computational complexity, Reducibility, NP-complete problem, NP-hard problem |
21 | Jun-Bao Li, Jeng-Shyang Pan 0001, Zhe-Ming Lu |
Face recognition using Gabor-based complete Kernel Fisher Discriminant analysis with fractional power polynomial models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 18(6), pp. 613-621, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Complete Kernel Fisher Discriminant (CKFD), Fractional Power Polynomial (FPP) models, Face recognition, Gabor wavelet, Kernel-based method |
21 | Yining Wu, Martin Caminada, Dov M. Gabbay |
Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 93(2-3), pp. 383-403, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
abstract argumentation, complete extensions, 3-valued stable models, logic programming |
21 | Yu Wang 0004, Xin Zheng |
Non-complete Topological Analysis in Image-Based 3D Building Reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HCI (7) ![In: Universal Access in Human-Computer Interaction. Applications and Services, 5th International Conference, UAHCI 2009, Held as Part of HCI International 2009, San Diego, CA, USA, July 19-24, 2009. Proceedings, Part III, pp. 256-261, 2009, Springer, 978-3-642-02712-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
non-complete topology analysis, weighted recognition algorithm, 3D reconstruction |
21 | Francis Y. L. Chin, Zeyu Guo 0001, He Sun 0001 |
Minimum Manhattan network is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 393-402, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
3-sat, minimum Manhattan network, NP-complete |
21 | Xiuli Xu, Ping Guo 0002 |
Iris Feature Extraction Based on the Complete 2DPCA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (2) ![In: Advances in Neural Networks - ISNN 2009, 6th International Symposium on Neural Networks, ISNN 2009, Wuhan, China, May 26-29, 2009, Proceedings, Part II, pp. 950-958, 2009, Springer, 978-3-642-01509-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Complete 2DPCA, Equal error rate, Feature extraction, Iris recognition |
21 | Taichi Haruna, Yukio-Pegio Gunji |
Double Approximation and Complete Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, 4th International Conference, RSKT 2009, Gold Coast, Australia, July 14-16, 2009. Proceedings, pp. 52-59, 2009, Springer, 978-3-642-02961-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
equivalence of categories, Rough sets, representation theorem, complete lattices |
21 | Jie Zhou 0009, Duoqian Miao, Qinrong Feng, Lijun Sun |
Research on Complete Algorithms for Minimal Attribute Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, 4th International Conference, RSKT 2009, Gold Coast, Australia, July 14-16, 2009. Proceedings, pp. 152-159, 2009, Springer, 978-3-642-02961-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
minimal reduct, complete algorithm, decision table, discernibility function |
21 | Kiyoshi Sawada |
Placing a Liaison between Two Members of the Same Level in an Organization Structure of a Complete Binary Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNPD ![In: Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008, In conjunction with Second International Workshop on Advanced Internet Technology and Applications, August 6-8, 2008, Phuket, Thailand, pp. 69-72, 2008, IEEE Computer Society, 978-0-7695-3263-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Liaison, Shortest path, Complete Binary tree, Organization structure |
21 | Wuu Yang, Huei-Ru Tseng, Rong-Hong Jan, Bor-Yeh Shen |
Broadcasting with the Least Energy is an NP-Complete Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MUE ![In: 2008 International Conference on Multimedia and Ubiquitous Engineering (MUE 2008), 24-26 April 2008, Busan, Korea, pp. 197-200, 2008, IEEE Computer Society, 978-0-7695-3134-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
least-energy problem, maximum-leaf spanning-tree problem, wireless network, graph theory, NP-complete |
21 | Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap |
Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings, pp. 87-94, 2008, ACM, 978-1-59593-904-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
complete numerical algorithm, evaluation bound, implicit algebraic curve, root bound, meshing, singularity, subdivision algorithm |
21 | Toufiq Benbouziane, Hassan El Houari, M'hammed El Kahoui |
Polynomial parametrization of nonsingular complete intersection curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 18(5), pp. 483-493, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Complete intersection, Locally nilpotent derivation, Polynomial parametrization |
21 | Wei-Chieh Ke, Bing-Hong Liu, Ming-Jer Tsai |
Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 56(5), pp. 710-715, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
wireless sensor networks, NP-Complete, coverage problem |
21 | Simson L. Garfinkel |
Complete delete vs. time machine computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGOPS Oper. Syst. Rev. ![In: ACM SIGOPS Oper. Syst. Rev. 41(1), pp. 42-44, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
MacOS, complete delete, file vault, secure empty trash, time machine computing |
21 | Maria Castillo, Federico Fariña, Alberto Córdoba, Jesús E. Villadangos |
A Modified O(n) Leader Election Algorithm for Complete Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2007), 7-9 February 2007, Naples, Italy, pp. 189-198, 2007, IEEE Computer Society, 0-7695-2784-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
distributed algorithms, leader election, I/O automata, complete networks |
21 | Shakeel Ahmad, Irfan Awan, Bashir Ahmad 0001 |
Performance Modelling of Finite Capacity Queues with Complete Buffer Partitioning Scheme for Bursty Traffic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia International Conference on Modelling and Simulation ![In: First Asia International Conference on Modelling and Simulation, AMS 2007, Phuket, Thailand, March 27-30, 2007, pp. 264-269, 2007, IEEE Computer Society, 978-0-7695-2845-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Complete partitioning queues, performance modelling, bursty traffic |
21 | Gordan Zitkovic |
Financial equilibria in the semimartingale setting: Complete markets and markets with withdrawal constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Finance Stochastics ![In: Finance Stochastics 10(1), pp. 99-119, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
financial equilibrium, complete markets, semimartingales, semimartingale functions, withdrawal constraints |
21 | Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser |
On the Crossing Number of Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 76(1-2), pp. 165-176, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
enumeration, Crossing number, complete graph, order types |
21 | Joachim Biskup, Lena Wiese |
On Finding an Inference-Proof Complete Database for Controlled Query Evaluation. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
DBSec ![In: Data and Applications Security XX, 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, Sophia Antipolis, France, July 31-August 2, 2006, Proceedings, pp. 30-43, 2006, Springer, 3-540-36796-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
confidentiality of data, complete database systems, Branch and Bound, propositional logic, inference control, SAT solving, lying, Controlled Query Evaluation |
21 | Mordechai Ben-Ari |
Minesweeper as an NP-complete problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGCSE Bull. ![In: ACM SIGCSE Bull. 37(4), pp. 39-40, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
minesweeper, NP-complete, SAT |
21 | Hadi Kharaghani, Rouzbeh Torabi |
On a Decomposition of Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 19(4), pp. 519-526, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Strongly regular graph, Balanced generalized weighing matrix, Complete graph, Symmetric design, Difference set |
21 | Stefan Dobrev |
Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(6), pp. 695-709, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Sense of Direction, Fault Tolerance, Distributed Computing, Broadcasting, Dynamic Faults, Complete Networks |
21 | Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser |
On the crossing number of complete graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002, pp. 19-24, 2002, ACM, 1-58113-504-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
rectilinear crossing number, complete graph, order type |
21 | Zoltán Ésik, Hans Leiß |
Greibach Normal Form in Algebraically Complete Semirings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings, pp. 135-150, 2002, Springer, 3-540-44240-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Greibach normal form, pre-fixed-point induction, Conway algebra, algebraically complete semirings, context-free languages, Kleene algebra, equational theory |
21 | Iwan M. Duursma, Carlos Rentería-Márquez, Horacio Tapia-Recillas |
Reed-Muller Codes on Complete Intersections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 11(6), pp. 455-462, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Complete intersection, Hilbert polynomial, Vanishing ideal, a -invariant of an ideal, Graded finite free resolution, Canonical module, Reed-Muller code |
21 | Taosong He, Lichan Hong, Dongqing Chen, Zhengrong Liang |
Reliable Path for Virtual Endoscopy: Ensuring Complete Examination of Human Organs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 7(4), pp. 333-342, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Virtual endscopy, reliable path, reliable navigation, NP-complete, visibility, camera control |
21 | Ben C. Moszkowski |
A Complete Axiomatization of Interval Temporal Logic with Infinite Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pp. 241-252, 2000, IEEE Computer Society, 0-7695-0725-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
complete axiom systems, Buechi-automata, temporal logic, regular expressions, finite-state automata, omega-automata |
21 | Lee J. White, Husain Almezen |
Generating Test Cases for GUI Responsibilities Using Complete Interaction Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSRE ![In: 11th International Symposium on Software Reliability Engineering (ISSRE 2000), 8-11 October 2000, San Jose, CA, USA, pp. 110-123, 2000, IEEE Computer Society, 0-7695-0807-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
GUI Object Collaboration, Complete Interaction Sequences, Graphical User Interfaces, GUI Testing |
21 | Jan Trdlicka, Pavel Tvrdík |
Embedding Complete k-ary Trees into 2-dimensional Meshes and Tori. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '97 Parallel Processing, Third International Euro-Par Conference, Passau, Germany, August 26-29, 1997, Proceedings, pp. 226-233, 1997, Springer, 3-540-63440-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
complete k-ary tree, 2-dimensional square mesh, embedding problem, dilation, expansion, load |
21 | Hal Burch, Fikret Erçal |
A Fast Algorithm for Complete Subcube Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 85-90, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
complete subcube recognition, order of complexity, parallel algorithms, processor allocation, hypercube topology |
21 | Eric Bach 0001, Anne Condon, Elton Glaser, Celena Tanguay |
DNA Models and Algorithms for NP-complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 290-300, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
3Sat, 3-Coloring, Independent Set problem, DNA algorithms, genetic algorithms, computational complexity, search problems, DNA computing, DNA computation, NP-complete problems, search algorithms, NP-hard problems |
21 | Juan Sabia, Pablo Solernó |
Bounds for traces in complete intersections and degrees in the Nullstellensatz. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 6(6), pp. 353-376, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Complete intersection polynomial ideals, Bezout’s inequality, Effective Nullstellensatz, Bertini’s theorem, Trace theory |
21 | Alon Itai, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks |
Optimal Distributed t-Resilient Election in Complete Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 16(4), pp. 415-420, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
optimal distributed t-resilient election, distributed leader election, election algorithm, fault-free network, software engineering, fault tolerant computing, distributed processing, computer networks, message complexity, complete networks |
21 | Pierre America, Jan J. M. M. Rutten |
Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFPS ![In: Mathematical Foundations of Programming Language Semantics, 3rd Workshop, Tulane University, New Orleans, Louisiana, USA, April 8-10, 1987, Proceedings, pp. 254-288, 1987, Springer, 3-540-19020-1. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
complete metric spaces, converging towers, contracting functors, Banach's fixed-point theorem, category theory, domain equations |
20 | Clemens Ley, Michael Benedikt |
How big must complete XML query languages be? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings, pp. 183-200, 2009, ACM, 978-1-60558-423-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Chaomin Luo, Simon X. Yang |
A Bioinspired Neural Network for Real-Time Concurrent Map Building and Complete Coverage Robot Navigation in Unknown Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks ![In: IEEE Trans. Neural Networks 19(7), pp. 1279-1298, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Anh Quang Pham, Lie-Liang Yang, Lajos Hanzo |
Unequal Error Protection Irregular Over-Complete Mapping for Wavelet Coded Wireless Video Telephony Using Iterative Source and Channel Decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCNC ![In: WCNC 2008, IEEE Wireless Communications & Networking Conference, March 31 2008 - April 3 2008, Las Vegas, Nevada, USA, Conference Proceedings, pp. 1251-1255, 2008, IEEE, 978-1-4244-1997-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari |
Building Complete Abstract Interpretations in a Linear Logic-based Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 5th International Symposium, SAS '98, Pisa, Italy, September 14-16, 1998, Proceedings, pp. 215-229, 1998, Springer, 3-540-65014-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
20 | Naveen Prakash |
Complete Methods for Building Complete Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Situational Method Engineering ![In: Situational Method Engineering: Fundamentals and Experiences, Proceedings of the IFIP WG 8.1 Working Conference, 12-14 September 2007, Geneva, Switzerland, pp. 207-221, 2007, Springer, 978-0-387-73946-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Matatyahu Rubin |
On Lalpha, omega complete extensions of complete theories of Boolean algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(5), pp. 571-582, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
L1, Tarskis invariants |
19 | Weng-Long Chang, Minyi Guo, Jesse Wu |
Is Cook's Theorem Correct for DNA-Based Computing? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISHPC ![In: High Performance Computing, 5th International Symposium, ISHPC 2003, Tokyo-Odaiba, Japan, October 20-22, 2003, Proceedings, pp. 222-233, 2003, Springer, 3-540-20359-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
NP-complete Problem, Molecular Computing, Biological Computing, DNA-based Computing |
19 | Hua Liu, Huilai Zou, Lili Zhong, Chaonan Wang, Youtian Qu |
Improvement of the Optimal Hamilton Circuit for Undirected Complete Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: 10th IEEE International Conference on Computer and Information Technology, CIT 2010, Bradford, West Yorkshire, UK, June 29-July 1, 2010, pp. 2129-2133, 2010, IEEE Computer Society, 978-0-7695-4108-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
undirected complete graph, Optimal Hamilton Circuit, Gradually Convergent Algorithm, Cross-wire Cutting Algorithm, Nearest Neighbor Algorithm |
19 | Tetsuya Kojima, Yoshiya Horii, Naoki Ohtani, Thierno Sene |
On Some Properties of a Digital Watermarking Based on Complete Complementary Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IIH-MSP ![In: Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2010), Darmstadt, Germany, 15-17 October, 2010, Proceedings, pp. 498-501, 2010, IEEE Computer Society, 978-1-4244-8378-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
complete complementary code, spread-spectrum system, DCT, digital watermarking |
19 | |
Effect of Cooperative Communication on Steganography Based on NP-Complete Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESIAT (1) ![In: 2009 International Conference on Environmental Science and Information Application Technology, ESIAT 2009, Wuhan, China, 4-5 July 2009, 3 Volumes, pp. 530-533, 2009, IEEE Computer Society, 978-0-7695-3682-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
NP-complete theory, steganography, effect, cooperative communication |
19 | Hanmin Jung, Mikyoung Lee, Beom-Jong You, Do-Wan Kim |
Comparative Evaluation of Reliabilities on Semantic Search Functions: Auto-complete and Entity-Centric Unified Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMT ![In: Active Media Technology, 5th International Conference, AMT 2009, Beijing, China, October 22-24, 2009. Proceedings, pp. 104-113, 2009, Springer, 978-3-642-04874-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Unified Search, Entity-centric Search, Ontology, Semantic Web, Reliability, Usability Test, Semantic Search, Named Entity, Auto-complete |
19 | Tarek Sayed Ahmed |
On Complete Representations of Reducts of Polyadic Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 89(3), pp. 325-332, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
polyadic algebras, complete representations, Algebraic logic |
19 | Joachim Biskup, Piero A. Bonatti |
Controlled query evaluation for enforcing confidentiality in complete information systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Inf. Sec. ![In: Int. J. Inf. Sec. 3(1), pp. 14-27, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Complete information system, Confidentiality, Inference control, Lying, Refusal |
19 | Hiroki Wada, Toshimitsu Masuzawa, Kewal K. Saluja, Hideo Fujiwara |
Design for Strong Testability of RTL Data Paths to Provide Complete Fault Efficiency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 13th International Conference on VLSI Design (VLSI Design 2000), 4-7 January 2000, Calcutta, India, pp. 300-305, 2000, IEEE Computer Society, 0-7695-0487-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Complete fault efficiency, Design for testability, Data path, Hierarchical test |
19 | David W. Binkley, Bradley M. Kuhn |
Crozzle: an NP-complete problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 1997 ACM symposium on Applied Computing, SAC'97, San Jose, CA, USA, February 28 - March 1, pp. 30-34, 1997, ACM, 0-89791-850-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
crozzle, complexity, NP-complete |
19 | P. Bosch, A. Carloganu, Daniel Etiemble |
Complete x86 instruction trace generation from hardware bus collect. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO ![In: 23rd EUROMICRO Conference '97, New Frontiers of Information Technology, 1-4 September 1997, Budapest, Hungary, pp. 402-408, 1997, IEEE Computer Society, 0-8186-8129-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
complete x86 instruction trace generation, hardware bus collect, architectural improvements, benchmark traces, hardware/software approach, x86 execution traces, commercial analyzer, computer architecture, microprocessors, memory hierarchies, trace driven simulation, performance data |
19 | Steven M. Seitz, Charles R. Dyer |
Complete Scene Structure from Four Point Correspondences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: Procedings of the Fifth International Conference on Computer Vision (ICCV 95), Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, June 20-23, 1995, pp. 330-337, 1995, IEEE Computer Society, 0-8186-7042-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
complete scene structure, four point correspondences, 3D scene structure, reference features, affine camera model, reconstructible features, motion techniques, edge detection, image sequences, image reconstruction, completeness, programming theory, real images, recursive algorithm, natural scenes, unified framework, parallax, feature correspondence, structure recovery, line features |
19 | Hosame Abu-Amara, Jahnavi Lokre |
Election in Asynchronous Complete Networks with Intermittent Link Failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(7), pp. 778-787, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
fault-tolerant leader election, asynchronous complete networks, intermittent link failures, fully-connected distributed networks, reliable processors, communication channel failures, algorithm execution, faulty channels, processor identifier set cardinality, undetectable faults, reliability, distributed algorithms, fault tolerant computing, communication complexity, failure analysis, message complexity, telecommunication channels, telecommunication network management |
19 | Brenda S. Baker |
Approximation Algorithms for NP-Complete Problems on Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(1), pp. 153-180, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
partition into perfect matchings, partition into triangles, approximation algorithms, NP-complete, planar graphs, dominating set, independent set, vertex cover, approximation schemes, Hamiltonian path, Hamiltonian circuit |
19 | Po-Jen Chuang, Nian-Feng Tzeng |
A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(4), pp. 467-479, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
processor allocation strategy, binary tree representations, complete subcube recognition, performance evaluation, computational complexity, resource allocation, performance measures, hypercube networks, hypercube computers, allocation strategies |
19 | Ajay K. Gupta 0001, Susanne E. Hambrusch |
Embedding Complete Binary Trees into Butterfly Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(7), pp. 853-863, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
wrap-around connections, multiprocessor interconnection networks, embeddings, trees (mathematics), complete binary trees, butterfly networks |
19 | Pramode Ranjan Bhattacharjee, Sanjoy Kumar Basu, Jogesh Chandra Paul |
Translation of the Problem of Complete Test Set Generation to Pseudo-Boolean Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(7), pp. 864-867, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
complete test set generation, logical expressions, real transforms, logic programming, logic testing, Boolean function, Boolean functions, formal logic, pseudo-Boolean programming |
19 | Vassilis Zissimopoulos, Vangelis Th. Paschos, Ferhan Pekergin |
On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(12), pp. 1413-1418, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
Boltzmann machine method, minimum vertex cover, computational complexity, parallel architectures, approximation, neural nets, NP-complete problems, heuristic programming, covering, clique, combinatorial mathematics, optimal solutions, maximum independent set, set partitioning, packing problems, minimum set cover |
19 | Vijay Raghavan 0002, Anand R. Tripathi |
Sequential Diagnosability is Co-NP Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(5), pp. 584-595, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
graph theory model, weighted model, co-NP complete, sequential diagnosability number, BGM models, computational complexity, graph theory, fault diagnosis, fault tolerant computing, software reliability, planar graphs, decision problem, PMC model |
19 | Uriel Feige, Shafi Goldwasser, László Lovász 0001, Shmuel Safra, Mario Szegedy |
Approximating Clique is Almost NP-Complete (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 2-12, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
approximation procedures, approximating clique, almost NP-complete, computational complexity, graph |
19 | Moiez A. Tapia, Jerry H. Tucker |
Complete Solution of Boolean Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 29(7), pp. 662-665, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
reduced solutions, characteristic equation, complete solutions, number of distinct solutions, parameterized solutions, Boolean algebra, Boolean equations |
18 | Hai Zhou 0001 |
Retiming and resynthesis with sweep are complete for sequential transformation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: Proceedings of 9th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2009, 15-18 November 2009, Austin, Texas, USA, pp. 192-197, 2009, IEEE, 978-1-4244-4966-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Lyublena Antova, Christoph Koch 0001, Dan Olteanu |
From complete to incomplete information and back. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, China, June 12-14, 2007, pp. 713-724, 2007, ACM, 978-1-59593-686-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hypothetical queries, world-set algebra, use cases, incomplete information, query rewriting |
18 | Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian |
Complete partitions of graphs. ![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. 860-869, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
18 | Gek Ling Chia, V. L. Chia |
On the Choice Numbers of Some Complete Multipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CJCDGCGT ![In: Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi'an, China, November 22-24, 2005, Revised Selected Papers, pp. 30-37, 2005, Springer, 978-3-540-70665-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Qing Wang 0006, David Dagan Feng |
A Novel Texture Descriptor Using Over-Complete Wavelet Transform and Its Fractal Signature. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIVR ![In: Image and Video Retrieval, 4th International Conference, CIVR 2005, Singapore, July 20-22, 2005, Proceedings, pp. 476-486, 2005, Springer, 3-540-27858-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Nadia Nedjah, Luiza de Macedo Mourelle |
Complete Pattern Matching: Recursivity Versus Multi-threading. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VECPAR ![In: High Performance Computing for Computational Science - VECPAR 2004, 6th International Conference, Valencia, Spain, June 28-30, 2004, Revised Selected and Invited Papers, pp. 598-609, 2004, Springer, 3-540-25424-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann 0001, Sebastiaan Terwijn |
Almost Complete Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 419-430, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Akira Matsubayashi, Ryo Takasu |
Minimum Congestion Embedding of Complete Binary Trees into Tori. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings, pp. 370-378, 1999, Springer, 3-540-66200-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Xiao Zhou 0001, Takao Nishizeki |
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 417-426, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
18 | Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari |
Complete Abstract Interpretations Made Constructive. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 366-377, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
18 | Rastislav Bodík, Rajiv Gupta 0001, Mary Lou Soffa |
Complete Removal of Redundant Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI), Montreal, Canada, June 17-19, 1998, pp. 1-14, 1998, ACM, 0-89791-987-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
control flow restructuring, demand-driven frequency data-flow analysis, speculative execution, partial redundancy elimination, profile-guided optimization |
18 | Rastislav Bodík, Rajiv Gupta 0001, Mary Lou Soffa |
Complete removal of redundant expressions (with retrospective) ![Search on Bibsonomy](Pics/bibsonomy.png) |
Best of PLDI ![In: 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, A Selection, pp. 596-611, 1998, ACM, 1-58113-623-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
control flow restructuring, demand-driven frequency data-flow analysis, speculative execution, partial redundancy elimination, profile-guided optimization |
18 | Alexandre Boudet, Evelyne Contejean, Claude Marché |
AC-Complete Unification and its Application to Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 7th International Conference, RTA-96, New Brunswick, NJ, USA, July 27-30, 1996, Proceedings, pp. 18-32, 1996, Springer, 3-540-61464-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
17 | Floris Geerts, Sofie Haesevoets, Bart Kuijpers |
First-order complete and computationally complete query languages for spatio-temporal databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 9(2), pp. 13:1-13:51, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
query languages, spatial databases, moving objects, spatio-temporal databases, Constraint databases |
17 | Artiom Alhazov, Liudmila Burtseva, Svetlana Cojocaru, Yurii Rogozhin |
Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Membrane Computing ![In: Membrane Computing - 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers, pp. 108-117, 2008, Springer, 978-3-540-95884-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Daniel J. Bernstein, Tanja Lange 0001, Reza Rezaeian Farashahi |
Binary Edwards Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHES ![In: Cryptographic Hardware and Embedded Systems - CHES 2008, 10th International Workshop, Washington, D.C., USA, August 10-13, 2008. Proceedings, pp. 244-265, 2008, Springer, 978-3-540-85052-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Edwards curves, complete addition law, Montgomery ladder, countermeasures against side-channel attacks, Elliptic curves, binary fields |
17 | Olivier Finkel, Dominique Lecomte |
There Exist Some omega -Powers of Any Borel Rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 115-129, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Infinite words, ?-languages, ?-powers, Cantor topology, topological complexity, Borel sets, Borel ranks, complete sets |
17 | Olivier Finkel |
On the Accepting Power of 2-Tape Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 301-312, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
2-tape Büchi automata, infinitary rational relations, Cantor topology, topological complexity, Borel hierarchy, complete sets |
Displaying result #101 - #200 of 30405 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|