|
|
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 |
15 | Mike J. Grannell, Martin Knor |
On the number of triangular embeddings of complete graphs and complete tripartite graphs. |
J. Graph Theory |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Maruthi Narayanan, Benjamin B. Kimia |
To complete or not to complete: Gap completion in real images. |
CVPR Workshops |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Edita Mácajová, Edita Rollová |
On the flow numbers of signed complete and complete bipartite graphs. |
Electron. Notes Discret. Math. |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Anders Sune Pedersen |
Complete and Almost Complete Minors in Double-Critical 8-Chromatic Graphs. |
Electron. J. Comb. |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Sebastian M. Cioaba, André Kündgen, Craig Timmons, Vladislav V. Vysotsky |
Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs. |
Comb. Probab. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Noam Livne |
All Natural NP-Complete Problems Have Average-Case Complete Versions. |
Comput. Complex. |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Dan McQuillan, R. Bruce Richter |
A Parity Theorem for Drawings of Complete and Complete Bipartite Graphs. |
Am. Math. Mon. |
2010 |
DBLP DOI BibTeX RDF |
|
15 | R. S. Manikandan, P. Paulraja |
Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs. |
Discret. Math. |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Stanislav Jendrol', Jozef Miskuf, Roman Soták |
Total edge irregularity strength of complete graphs and complete bipartite graphs. |
Discret. Math. |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Saïd Bettayeb, Quan T. Nguyen |
The genus of the complete multipartite graph and the complete multi-layered graph. |
AICCSA |
2010 |
DBLP DOI BibTeX RDF |
|
15 | G. Sethuraman 0001, S. Venkatesh |
Decomposition Of Complete Graphs And Complete Bipartite Graphs Into α-Labelled Trees. |
Ars Comb. |
2009 |
DBLP BibTeX RDF |
|
15 | Mike J. Grannell, Terry S. Griggs |
A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Stanislav Jendrol', Jozef Miskuf, Roman Soták |
Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs. |
Electron. Notes Discret. Math. |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Sylwia Cichacz |
Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails. |
Discuss. Math. Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Hongliang Lai, Dexue Zhang |
Complete and directed complete Omega-categories. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Stefano Marcugini, Alfredo Milani, Fernanda Pambianco |
Complete arcs in PG(2, 25): The spectrum of the sizes and the classification of the smallest complete arcs. |
Discret. Math. |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Erhard Aichinger, Jürgen Ecker |
Every (k+1)-affine Complete Nilpotent Group of Class K Is Affine Complete. |
Int. J. Algebra Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
15 | V. V. Ovchinnikov |
Architecture of a semantic data integration system based on a semantically complete model and a semantically complete query language. |
Program. Comput. Softw. |
2006 |
DBLP DOI BibTeX RDF |
|
15 | R. S. Manikandan, P. Paulraja |
Hamiltonian decompositions of the tensor product of a complete graph and a complete bipartite graph. |
Ars Comb. |
2006 |
DBLP BibTeX RDF |
|
15 | Floris Geerts, Sofie Haesevoets, Bart Kuijpers |
First-order Complete and Computationally Complete Query Languages for Spatio-Temporal Databases |
CoRR |
2005 |
DBLP BibTeX RDF |
|
15 | Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt |
Altitude of small complete and complete bipartite graphs. |
Australas. J Comb. |
2005 |
DBLP BibTeX RDF |
|
15 | Ruying Liu, Haixing Zhao, Chengfu Ye |
A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs. |
Discret. Math. |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Mariangiola Dezani-Ciancaglini, Furio Honsell, Fabio Alessi |
A complete characterization of complete intersection-type preorders. |
ACM Trans. Comput. Log. |
2003 |
DBLP DOI BibTeX RDF |
lambda models, completeness, Lambda calculus, intersection types |
15 | G. Sethuraman 0001, P. Selvaraju |
Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs. |
Discret. Math. |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Brian Jacobson, Andrew Niedermaier, Victor Reiner |
Critical groups for complete multipartite graphs and Cartesian products of complete graphs. |
J. Graph Theory |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Nicholas Pippenger |
Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs. |
SIAM J. Discret. Math. |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Mathew Cropper, Anthony J. W. Hilton |
Hall parameters of complete and complete bipartite graphs. |
J. Graph Theory |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Frank Harary, Michael S. Jacobson |
Destroying symmetry by orienting edges: Complete graphs and complete bigraphs. |
Discuss. Math. Graph Theory |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Mariangiola Dezani-Ciancaglini, Furio Honsell, Fabio Alessi |
A Complete Characterization of Complete Intersection-Type Theories |
CoRR |
2000 |
DBLP BibTeX RDF |
|
15 | James Harley |
Jan Boerman: The Complete Tape Music Dick Raaijmakers: The Complete Tape Music. |
Comput. Music. J. |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Mariangiola Dezani-Ciancaglini, Furio Honsell, Fabio Alessi |
A Complete Characterization of the Complete Intersection-Type Theories. |
ICALP Satellite Workshops |
2000 |
DBLP BibTeX RDF |
|
15 | Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau |
Edge-disjoint spanners of complete graphs and complete digraphs. |
Discret. Math. |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Nigel Martin |
Complete bipartite factorisations by complete bipartite graphs. |
Discret. Math. |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Dorit Dor, Michael Tarsi |
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau |
Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. |
HICSS (1) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Qing-Xue Huang |
Complete m-partite decompositions of complete multigraphs. |
Ars Comb. |
1996 |
DBLP BibTeX RDF |
|
15 | Jorge L. Ramírez Alfonsín |
Cycle decompositions of complete and complete multipartite graphs. |
Australas. J Comb. |
1995 |
DBLP BibTeX RDF |
|
15 | Chiang Lin, Jenq-Jong Lin, Tay-Woei Shyu |
Complete Bipartite Decompositions of Crowns, with Applications to Complete Directed Graphs. |
Combinatorics and Computer Science |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Midori Kobayashi, Gisaku Nakamura |
On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs. |
Graphs Comb. |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Ralph Freese, George Grätzer, E. Tamás Schmidt |
On Complete Congruence Lattices of Complete Modular Lattices. |
Int. J. Algebra Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
15 | Dominique de Caen, D. G. Hoffman |
Impossibility of Decomposing the Complete Graph on n Points into n-1 Isomorphic Complete Bipartite Graphs. |
SIAM J. Discret. Math. |
1989 |
DBLP DOI BibTeX RDF |
|
15 | Hans-Dietrich O. F. Gronau |
Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I. |
Discret. Math. |
1981 |
DBLP DOI BibTeX RDF |
|
15 | Nuel Belnap, Storrs McCall |
Every functionally complete m-valued logic has a Post-complete axiomatization. |
Notre Dame J. Formal Log. |
1970 |
DBLP DOI BibTeX RDF |
|
15 | Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter |
Applying Modular Decomposition to Parameterized Cluster Editing Problems. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Edge modification problems, Bicluster graphs, NP-complete problems, Fixed-parameter tractability, Cluster graphs |
15 | Foto N. Afrati, Phokion G. Kolaitis |
Repair checking in inconsistent databases: algorithms and complexity. |
ICDT |
2009 |
DBLP DOI BibTeX RDF |
coNP-complete problem, equality-generating dependencies, repair checking, tuple-generating dependencies, weakly acyclic set, polynomial time, consistent query answering, inconsistent databases, database repairs |
15 | Anatolij Dvurecenskij, Flavia Ventriglia |
On two versions of the Loomis-Sikorski Theorem for algebraic structures. |
Soft Comput. |
2008 |
DBLP DOI BibTeX RDF |
Generalized pseudo effect algebra, Pseudo Vitali space, Monotone ?-complete algebra, Loomis-Sikorski Theorem, g-Effect-tribe, g-Vitali space, State |
15 | Elena I. Ganzha, Valery M. Loginov, Sergey P. Tsarev |
Exact Solutions of Hyperbolic Systems of Kinetic Equations. Application to Verhulst Model with Random Perturbation. |
Math. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
complete non-stationary solutions, kinetic processes, Verhulst model, hyperbolic systems, Master equations |
15 | Olivier Finkel |
Wadge Degrees of Infinitary Rational Relations. |
Math. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
2-tape Büchi automata, infinitary rational relations, Cantor topology, topological complexity, Wadge hierarchy, Wadge degrees, Wadge games, Borel hierarchy, complete sets |
15 | Sun-Yuan Hsieh, Huang-Ming Gao |
On the partial terminal Steiner tree problem. |
J. Supercomput. |
2007 |
DBLP DOI BibTeX RDF |
The Steiner tree problem, The partial terminal Steiner tree problem, Approximation algorithms, NP-complete, MAX SNP-hard |
15 | Antonio Di Nola, Mirko Navara |
MV-Algebras with the Cantor-Bernstein Property. |
IFSA (2) |
2007 |
DBLP DOI BibTeX RDF |
Cantor-Bernstein theorem, boolean element of an MV-algebra, partition of unity, direct product decomposition, ?-complete MV-algebra, multiplicative MV-algebra, MV-algebra |
15 | Chun-Yuan Chiu, Yu-Liang Kuo, Hsiao-Kuang Wu, Gen-Huey Chen |
Bandwidth constrained routing problem in multi-hop wireless networks. |
MSWiM |
2006 |
DBLP DOI BibTeX RDF |
NP-complete, MAC, bandwidth, QoS routing, multi-hop wireless network |
15 | Yen Hung Chen, Chuan Yi Tang |
The Bottleneck Tree Alignment Problems. |
ICCSA (3) |
2006 |
DBLP DOI BibTeX RDF |
bottleneck tree alignment, metric, NP-complete, Edit distance, ultrametric |
15 | Dieter Spreen |
Strong reducibility of partial numberings. |
Arch. Math. Log. |
2005 |
DBLP DOI BibTeX RDF |
Partial numberings, Total numberings, Complete numberings, Degree structure, Reducibility |
15 | Gang Zeng, Sylvain Paris, Long Quan, François X. Sillion |
Progressive Surface Reconstruction from Images Using a Local Prior. |
ICCV |
2005 |
DBLP DOI BibTeX RDF |
Local Prior, Voxel Carving, Complete/Partial Reconstruction, Surface Reconstruction, Graph Cut |
15 | Vincenzo Cutello, Giuseppe Narzisi, Giuseppe Nicosia, Mario Pavone |
Clonal Selection Algorithms: A Comparative Case Study Using Effective Mutation Potentials. |
ICARIS |
2005 |
DBLP DOI BibTeX RDF |
CLONALG, opt-IA, one- counting, trap functions, 2D HP Protein Structure Prediction, pattern recognition, NP-complete problems, numerical optimization, Clonal Selection Algorithms |
15 | Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth |
An Assmus-Mattson-Type Approach for Identifying 3-Designs from Linear Codes over Z4. |
Des. Codes Cryptogr. |
2004 |
DBLP DOI BibTeX RDF |
Z 4 codes, Assmus-Mattson, complete weight enumerator, t-designs |
15 | Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick |
Existential second-order logic over graphs: Charting the tractability frontier. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
Existential second-order logic, graph constraints, prefix classes, graph coloring, NP-complete problems, finite model theory |
15 | Laurent Perrinet |
Finding independent components using spikes: A natural result of hebbian learning in a sparse spike coding scheme. |
Nat. Comput. |
2004 |
DBLP DOI BibTeX RDF |
over-complete representation, parallel asynchronous processing, sparse spike coding, wavelet transform, emergence, vision, natural images statistics, hebbian learning |
15 | Marcel Erné, Branimir Seselja, Andreja Tepavcevic |
Posets Generated by Irreducible Elements. |
Order |
2003 |
DBLP DOI BibTeX RDF |
(completely) irreducible, join-dense, completion, poset, complete lattice |
15 | Anthony T. C. Tam, Cho-Li Wang |
Contention-Aware Communication Schedule for High-Speed Communication. |
Clust. Comput. |
2003 |
DBLP DOI BibTeX RDF |
congestion control, hierarchical network, complete exchange, low-latency communication |
15 | Chiuyuan Chen |
Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian. |
J. Comb. Optim. |
2003 |
DBLP DOI BibTeX RDF |
maximal planar graph, separating triangle, NP-complete, planar graph, hamiltonian cycle |
15 | Victor Khomenko, Maciej Koutny, Alexandre Yakovlev |
Detecting State Coding Conflicts in STG Unfoldings Using SAT. |
ACSD |
2003 |
DBLP DOI BibTeX RDF |
complete state coding, CSC, net unfoldings, Petri nets, asynchronous circuits, SAT, signal transition graphs, STG, automated synthesis |
15 | Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier |
Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
edge modification problems, data clustering, NP-complete problems, exact algorithms, fixed-parameter tractability |
15 | Marek Golasinski |
Disconnected Equivariant Rational Homotopy Theory. |
Appl. Categorical Struct. |
2002 |
DBLP DOI BibTeX RDF |
closed model category, cofinite EI-category, equivariant KS-minimal model, Grothendieck construction, Hamiltonian group, linearly compact k-module, system of differential graded complete algebras and simplicial sets |
15 | Susan Landau 0001, Neil Immerman |
Embedding Linkages on an Integer Lattice. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
NP-complete, Embedding, Lattice, Linkage |
15 | Demetres D. Kouvatsos, Khalid Al-Begain, Irfan-Ullah Awan |
A Queueing Model for a Wireless GSM/GPRS Cell with Multiple Service Classes. |
NETWORKING |
2002 |
DBLP DOI BibTeX RDF |
Cellular mobile system, Global System for Mobile Telecommunication (GSM), wireless GSM/GPRS cell, complete partitioning scheme (CPS), maximum entropy (ME) principle, generalised exponential (GE) distribution, first-come-first-served (FCFS) rule, processor sharing (PS) rule, performance evaluation, General Packet Radio Service (GPRS) |
15 | Pierre Soille |
Advances in the Analysis of Topographic Features on Discrete Images. |
DGCI |
2002 |
DBLP DOI BibTeX RDF |
minima imposition, plateau, lower complete transformation, grey scale hit-or-miss, crest lines, grey scale skeletonisation, Mathematical morphology, watersheds |
15 | Zdenka Riecanová |
Sub-effect algebras and Boolean sub-effect algebras. |
Soft Comput. |
2001 |
DBLP DOI BibTeX RDF |
Sub-effect algebra, Boolean sub-effect algebra, Complete effect algebra, Blocks, Effect algebra |
15 | Joanna Bryson, Lynn Andrea Stein |
Modularity and Specialized Learning: Mapping between Agent Architectures and Brain Organization. |
Emergent Neural Computational Architectures Based on Neuroscience |
2001 |
DBLP DOI BibTeX RDF |
Structural and Temporal Modularity, Complete Autonomous Agents, Behavior-Based AI, Brain Organization, Action Selection and Synchronization, Perceptual, Episodic and Semantic Memory, Spatial |
15 | Nicolas T. Courtois |
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank. |
ASIACRYPT |
2001 |
DBLP DOI BibTeX RDF |
MinRank problem, rank-distance codes, syndrome decoding (SD), identification, NP-complete problems, group signatures, Zero-knowledge, ring signatures, multivariate cryptography, entity authentication |
15 | Michael Buro |
Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs. |
Computers and Games |
2000 |
DBLP DOI BibTeX RDF |
Amazons endgame, planning, NP-complete, puzzle |
15 | Jens Gramm, Rolf Niedermeier |
Faster Exact Solutions for MAX2SAT. |
CIAC |
2000 |
DBLP DOI BibTeX RDF |
MAX2SAT, Maximum Cut, NP-complete problems, exact algorithms, parameterized complexity |
15 | Tomoko Ninomiya, Masao Mukaidono |
Independence of the Axioms of Boolean Algebra in Multiple-Valued Logic. |
ISMVL |
2000 |
DBLP DOI BibTeX RDF |
the Method of Indeterminate Coefficients, Independency of axioms, complete set of axioms, Boolean algebra |
15 | Jan E. Jonker |
Knaster-Tarski Revisited. |
Formal Aspects Comput. |
1998 |
DBLP DOI BibTeX RDF |
Complete partial order, Generalization, Fixpoint |
15 | Vincenzo Auletta, Amelia De Vivo, Vittorio Scarano |
Multiple Templates Access of Trees in Parallel Memory Systems. |
IPPS |
1997 |
DBLP DOI BibTeX RDF |
multiple template access, node mapping algorithms, subtree templates, root-to-leaf path templates, preprocessing phase, data structure, time complexity, tree data structures, load, complete binary trees, conflict-free access, parallel access, memory modules, parallel memory systems |
15 | Alioune Ngom, Corina Reischer, Dan A. Simovici, Ivan Stojmenovic |
Completeness Criteria in Set-Valued Logic Under Compositions with Union and Intersection. |
ISMVL |
1997 |
DBLP DOI BibTeX RDF |
completeness criteria, set-valued logic, Boolean completeness problems, r-valued set logic, logic of functions, n-tuples, set logic circuits, S-complete, U-maximal sets, completeness criterion, U functions, compositions, Boolean functions, Boolean functions, intersection, union |
15 | Yu-Chee Tseng, Sandeep K. S. Gupta |
All-to-All Personalized Communication in a Wormhole-Routed Torus. |
IEEE Trans. Parallel Distributed Syst. |
1996 |
DBLP DOI BibTeX RDF |
parallel computing, wormhole routing, collective communication, torus, multicomputer network, complete exchange, All-to-all personalized communication |
15 | Farokh B. Bastani, Bojan Cukic |
Impact of program transformation on software reliability assessment. |
HASE |
1996 |
DBLP DOI BibTeX RDF |
statistical sampling method, complete program paths, partial proofs, reliability assessment procedure, formal methods, program transformation, program verification, correctness, software fault tolerance, safety critical software, test cases, operational profile, reliability estimate, software reliability assessment |
15 | Horst Herrlich |
CompactT0-spaces andT0-compactifications. |
Appl. Categorical Struct. |
1993 |
DBLP DOI BibTeX RDF |
Extension closed and nearly closed subspaces ofT 0-spaces, compact spaces, compactifications, k-complete spaces, k-completions, Wallman compactifications, ech-Stone compactifications, extensions of mappings, C*-embeddings, E-compactifications, almost reflective and implicational subcategories ofTop |
15 | Wenfei Fan, Floris Geerts |
Capturing missing tuples and missing values. |
PODS |
2010 |
DBLP DOI BibTeX RDF |
information completeness, master data, missing data |
15 | Wojciech Jamroga, Jürgen Dix |
Model Checking Abilities of Agents: A Closer Look. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Multi-agent systems, Model checking, Computational complexity |
15 | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
Completeness in Two-Party Secure Computation: A Computational View. |
J. Cryptol. |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
Completeness in two-party secure computation: a computational view. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
oblivious tansfer, completeness, secure computation |
15 | David W. Juedes, Jack H. Lutz |
Completeness and Weak Completeness Under Polynomial-Size Circuits. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Alan Mycroft |
Completeness and predicate-based abstract interpretation. |
PEPM |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Dung T. Huynh, Lu Tian |
The complexity of readiness and failure equivalences for processes. |
SPDP |
1991 |
DBLP DOI BibTeX RDF |
|
14 | Benjamin Piwowarski, Andrew Trotman, Mounia Lalmas |
Sound and complete relevance assessment for XML retrieval. |
ACM Trans. Inf. Syst. |
2008 |
DBLP DOI BibTeX RDF |
XML, evaluation, XML retrieval, passage retrieval, INEX, relevance assessment |
14 | Luca Pulina, Armando Tacchella |
QuBIS: An (In)complete Solver for Quantified Boolean Formulas. |
MICAI |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Dorothea Baumeister, Jörg Rothe |
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. |
LATA |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Jian Xu 0004, Fucai Zhou, Xinyang Li, Muzhou Yang |
Hierarchical Data Processing Model and Complete Tree Key Management Mechanism. |
ICYCS |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Dario Fischbein, Sebastián Uchitel |
On correct and complete strong merging of partial behaviour models. |
SIGSOFT FSE |
2008 |
DBLP DOI BibTeX RDF |
modal transition systems, partial behaviour models, merge, elaboration |
14 | Peter Che Bor Lam, Wensong Lin, Jianzhuan Wu |
L ( j , k )- and circular L ( j , k )-labellings for the products of complete graphs. |
J. Comb. Optim. |
2007 |
DBLP DOI BibTeX RDF |
? j, k -number, ? j, k -number, Cartesian product, Direct product |
14 | Peng Yu, B. T. Thomas Yeo, Patricia Ellen Grant, Bruce Fischl, Polina Golland |
Cortical Folding Development Study based on Over-Complete Spherical Wavelets. |
ICCV |
2007 |
DBLP DOI BibTeX RDF |
|
14 | Jiu-Tao Nie, Xu Cheng 0001 |
An Efficient SSA-Based Algorithm for Complete Global Value Numbering. |
APLAS |
2007 |
DBLP DOI BibTeX RDF |
|
14 | Ryan C. Harkins, John M. Hitchcock, Aduri Pavan |
Strong Reductions and Isomorphism of Complete Sets. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
14 | Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe |
Representation of Partial Knowledge and Query Answering in Locally Complete Databases. |
LPAR |
2006 |
DBLP DOI BibTeX RDF |
|
14 | Haiyun Bian, Raj Bhatnagar |
Efficiently Mining Maximal 1-complete Regions from Dense Datasets. |
ICDM Workshops |
2006 |
DBLP DOI BibTeX RDF |
|
14 | Grigore Rosu |
Complete Categorical Deduction for Satisfaction as Injectivity. |
Essays Dedicated to Joseph A. Goguen |
2006 |
DBLP DOI BibTeX RDF |
|
14 | Javier Esparza, Petr Jancar, Alexander Miller |
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs. |
ACSD |
2006 |
DBLP DOI BibTeX RDF |
|
14 | Sunshin Kim, Kwang Su Jung, Keun Ho Ryu |
Automatic Orthologous-Protein-Clustering from Multiple Complete-Genomes by the Best Reciprocal BLAST Hits. |
BioDM |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #301 - #400 of 30405 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|