21 search results - page 3 / 5 » soda 2007 |
SODA
2007
ACM
13 years 8 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
ICIAP
2007
ACM
14 years 7 months ago
2007
ACM
In this paper, we propose the combination of the Self Organizing Map (SOM) and of the tangent distance for effective clustering in Document Image Analysis. The proposed model (SOM...
ERCIMDL
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we describe a system to perform Document Image Retrieval in Digital Libraries. The system allows users to retrieve digitized pages on the basis of layout similaritie...
SODA
2007
ACM
13 years 8 months ago
2007
ACM
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
SODA
2007
ACM
13 years 8 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...