13621 search results - page 370 / 2725 » Computability and Complexity in Self-assembly |
170
click to vote
TCAD
2008
15 years 6 months ago
2008
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
156
click to vote
COMGEO
2010
ACM
15 years 5 months ago
2010
ACM
Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
144
click to vote
GI
2004
Springer
16 years 5 days ago
2004
Springer
Abstract: The vision process is very complex and requires for its realization in artificial systems a fundamentally new technology for systems generation. This must be based on pr...
186
click to vote
IDA
2009
Springer
15 years 11 months ago
2009
Springer
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorit...
169
Voted
ICGI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...