232 search results - page 22 / 47 » Fast High-Dimensional Data Search in Incomplete Databases |
SIGMOD
2010
ACM
14 years 9 months ago
2010
ACM
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
102
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
103
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: In proteomic analysis, MS/MS spectra acquired by mass spectrometer are assigned to peptides by database searching algorithms such as SEQUEST. The assignations of pepti...
102
click to vote
BMCBI
2010
14 years 11 months ago
2010
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
112
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...