2168 search results - page 315 / 434 » Randomized Algorithms and Complexity Theory |
141
click to vote
DNA
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Self-assembly is a process in which basic units aggregate under attractive forces to form larger compound structures. Recent theoretical work has shown that pseudo-crysta...
123
Voted
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
123
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
136
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We are interested in engineering smart machines that enable backtracking of emergent behaviors. Our SSNNS simulator consists of hand-picked tools to explore spiking neural network...
107
click to vote
GIS
2008
ACM
15 years 4 months ago
2008
ACM
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...