Sciweavers

4302 search results - page 257 / 861
» Index Pairs Algorithms
Sort
View
SPIRE
2005
Springer
15 years 6 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
83
Voted
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
15 years 2 months ago
Large-Scale Many-Class Learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Michael Connor
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
15 years 2 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro
96
Voted
CIKM
2010
Springer
14 years 11 months ago
Query optimization for ontology-based information integration
In recent years, there has been an explosion of publicly available RDF and OWL data sources. In order to effectively and quickly answer queries in such an environment, we present...
Yingjie Li, Jeff Heflin
MTA
2011
260views Hardware» more  MTA 2011»
14 years 7 months ago
An audio watermarking scheme using singular value decomposition and dither-modulation quantization
Quantization index modulation is one of the best methods for performing blind watermarking, due to its simplicity and good rate-distortion-robustness tradeoffs. In this paper, a ne...
Vivekananda Bhat K., Indranil Sengupta, Abhijit Da...