4850 search results - page 8 / 970 » Approximate Data Structures with Applications |
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
ICDIM
2008
IEEE
14 years 2 months ago
2008
IEEE
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
COMPGEOM
1997
ACM
14 years 19 days ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
VLDB
2002
ACM
14 years 8 months ago
2002
ACM
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...