13621 search results - page 302 / 2725 » Computability and Complexity in Self-assembly |
180
click to vote
COGSCI
2004
15 years 6 months ago
2004
This paper advocates the main ideas of the interactive model of representation of Mark Bickhard and the assimilation/accommodation framework of Jean Piaget, through a rhythm recog...
185
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
178
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
159
click to vote
CVPR
2006
IEEE
16 years 23 days ago
2006
IEEE
We present a novel method for jointly performing recognition of complex events and linking fragmented tracks into coherent, long-duration tracks. Many event recognition methods re...
199
click to vote
WAOA
2005
Springer
16 years 5 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...