Sciweavers

921 search results - page 88 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 5 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
NIPS
2008
15 years 5 months ago
Online Metric Learning and Fast Similarity Search
Metric learning algorithms can provide useful distance functions for a variety of domains, and recent work has shown good accuracy for problems where the learner can access all di...
Prateek Jain, Brian Kulis, Inderjit S. Dhillon, Kr...
MTA
1998
157views more  MTA 1998»
15 years 4 months ago
Brahma: Browsing and Retrieval Architecture for Hierarchical Multimedia Annotation
Traditional browsing of large multimedia documents (e.g., video, audio) is primarily sequential. In the absence of an index structure browsing and searching for relevant informatio...
Asit Dan, Dinkar Sitaram, Junehwa Song
BMCBI
2007
148views more  BMCBI 2007»
15 years 4 months ago
Blast sampling for structural and functional analyses
Background: The post-genomic era is characterised by a torrent of biological information flooding the public databases. As a direct consequence, similarity searches starting with ...
Anne Friedrich, Raymond Ripp, Nicolas Garnier, Emm...
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
15 years 8 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore