Sciweavers

4836 search results - page 309 / 968
» Exploring the Similarity Space
Sort
View
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
16 years 10 days ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...
GECCO
2009
Springer
125views Optimization» more  GECCO 2009»
15 years 11 months ago
Preserving population diversity for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
Abel Garcia-Najera
195
Voted
IJCV
2007
138views more  IJCV 2007»
15 years 6 months ago
Correspondence-free Structure from Motion
We present a novel approach for the estimation of 3D-motion directly from two images using the Radon transform. The feasibility of any camera motion is computed by integrating over...
Ameesh Makadia, Christopher Geyer, Kostas Daniilid...
DMIN
2009
142views Data Mining» more  DMIN 2009»
15 years 4 months ago
Efficient Record Linkage using a Double Embedding Scheme
Record linkage is the problem of identifying similar records across different data sources. The similarity between two records is defined based on domain-specific similarity functi...
Noha Adly
DAC
2003
ACM
16 years 7 months ago
An IDF-based trace transformation method for communication refinement
In the Artemis project [13], design space exploration of embedded systems is provided by modeling application behavior and architectural performance constraints separately. Mappin...
Andy D. Pimentel, Cagkan Erbas