2570 search results - page 219 / 514 » Fast Algorithms For The Computation Of Ranklets |
182
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
147
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
123
click to vote
CGF
2005
15 years 4 months ago
2005
We introduce a technique to rapidly generate summed-area tables using graphics hardware. Summed area tables, originally introduced by Crow, provide a way to filter arbitrarily lar...
107
click to vote
ICSE
2003
IEEE-ACM
16 years 4 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
133
click to vote
WINE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...