6315 search results - page 140 / 1263 » Approximating Solution Structure |
249
click to vote
VLDB
2002
ACM
16 years 6 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...
171
click to vote
ICPR
2008
IEEE
16 years 26 days 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...
186
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
183
click to vote
TODS
2002
15 years 6 months ago
2002
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
269
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...