Sciweavers

2157 search results - page 35 / 432
» Optimal Fast Hashing
Sort
View
NIPS
2008
15 years 4 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...
CVPR
2004
IEEE
16 years 5 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
MICCAI
2004
Springer
16 years 3 months ago
Progressive Attenuation Fields: Fast 2D-3D Image Registration Without Precomputation
This paper introduces the progressive attenuation field (PAF), a method to speed up computation of digitally reconstructed radiograph (DRR) images during intensity-based 2D-3D regi...
Torsten Rohlfing, Daniel B. Russakoff, Joachim Den...
AHS
2007
IEEE
210views Hardware» more  AHS 2007»
15 years 9 months ago
MOVES: A Modular Framework for Hardware Evolution
In this paper, we present a framework that supports experimenting with evolutionary hardware design. We describe the framework’s modules for composing evolutionary optimizers an...
Paul Kaufmann, Marco Platzner
SIGMOD
2011
ACM
210views Database» more  SIGMOD 2011»
14 years 5 months ago
A platform for scalable one-pass analytics using MapReduce
Today’s one-pass analytics applications tend to be data-intensive in nature and require the ability to process high volumes of data efficiently. MapReduce is a popular programm...
Boduo Li, Edward Mazur, Yanlei Diao, Andrew McGreg...