Sciweavers

2514 search results - page 23 / 503
» On the Computation of Approximations of Database Queries
Sort
View
CVPR
1997
IEEE
16 years 8 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
SSDBM
2007
IEEE
118views Database» more  SSDBM 2007»
16 years 13 days ago
Database Support for Weighted Match Joins
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...
Ameet Kini, Jeffrey F. Naughton
TALG
2010
110views more  TALG 2010»
15 years 4 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
ERCIMDL
2005
Springer
82views Education» more  ERCIMDL 2005»
15 years 11 months ago
A Native XML Database Supporting Approximate Match Search
XML is becoming the standard representation format for metadata. Metadata for multimedia documents, as for instance MPEG-7, require approximate match search functionalities to be s...
Giuseppe Amato, Franca Debole
ICDE
1996
IEEE
142views Database» more  ICDE 1996»
16 years 7 months ago
Approximate Queries and Representations for Large Data Sequences
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Hagit Shatkay, Stanley B. Zdonik