13621 search results - page 146 / 2725 » Computability and Complexity in Self-assembly |
190
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
169
click to vote
AMC
2007
15 years 6 months ago
2007
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
154
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
166
click to vote
CCCG
2009
15 years 4 months ago
2009
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
212
click to vote
CVPR
2009
IEEE
17 years 20 days ago
2009
IEEE
We describe a novel and robust feature descriptor called ordinal spatial intensity distribution (OSID) which is invariant to any monotonically increasing brightness changes. Many t...