4218 search results - page 273 / 844 » Complete sets of cooperations |
103
Voted
NC
2008
15 years 24 days ago
2008
Molecular self-assembly is a promising approach to bottom-up fabrication of complex structures. A major impediment to the practical use of self-assembly to create complex structure...
209
click to vote
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
111
click to vote
CADE
2008
Springer
16 years 1 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
91
Voted
IMR
2004
Springer
15 years 6 months ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
104
Voted
FROCOS
2009
Springer
15 years 4 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...