10608 search results - page 83 / 2122 » Complexity of O'Hara's Algorithm |
ICDAR
2007
IEEE
14 years 4 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...
WADS
2007
Springer
14 years 4 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 ...
STOC
2004
ACM
14 years 10 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...
ER
2007
Springer
14 years 4 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 ...
STOC
1996
ACM
14 years 2 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...