10988 search results - page 137 / 2198 » Algorithmic Folding Complexity |
128
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
123
Voted
ICDAR
2007
IEEE
15 years 9 months ago
2007
IEEE
Document image segmentation algorithms primarily aim at separating text and graphics in presence of complex layouts. However, for many non-Latin scripts, segmentation becomes a ch...
109
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
Building on the work of Martinetz, Schulten and de Silva, Carlsson, we introduce a 2-parameter family of witness complexes and algorithms for constructing them. This family can be ...
135
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
101
Voted
ER
2007
Springer
15 years 8 months ago
2007
Springer
Ensuring the semantic and topological correctness of spatial data is an important requirement in geographical information systems and spatial database systems in order to preserve ...