4066 search results - page 227 / 814 » Almost Complete Sets |
229
click to vote
FORTE
2011
14 years 10 months ago
2011
We present a new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are semantically justified. The multi-party sessio...
171
click to vote
NC
2008
15 years 6 months 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...
300
click to vote
ICDE
2006
IEEE
16 years 8 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...
187
click to vote
CADE
2008
Springer
16 years 6 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...
147
click to vote
IMR
2004
Springer
15 years 12 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...