Sciweavers

1054 search results - page 91 / 211
» Fast Approximated SIFT
Sort
View
124
Voted
MST
2010
93views more  MST 2010»
15 years 2 months ago
Atomic Congestion Games: Fast, Myopic and Concurrent
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
CVIU
2011
14 years 11 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura
ICASSP
2011
IEEE
14 years 7 months ago
Machine and acoustical condition dependency analyses for fast acoustic likelihood calculation techniques
The acceleration of acoustic likelihood calculation has been an important research issue for developing practical speech recognition systems. And there are various specification ...
Atsunori Ogawa, Satoshi Takahashi, Atsushi Nakamur...
CVPR
2012
IEEE
13 years 6 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn
ICCV
2003
IEEE
16 years 6 months ago
Fast Pose Estimation with Parameter-Sensitive Hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...