Sciweavers

6365 search results - page 329 / 1273
» Fast Local Computation Algorithms
Sort
View
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
14 years 6 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...
CVPR
2007
IEEE
16 years 8 months ago
Learning Local Image Descriptors
In this paper we study interest point descriptors for image matching and 3D reconstruction. We examine the building blocks of descriptor algorithms and evaluate numerous combinati...
Simon A. J. Winder, Matthew Brown
CVPR
2010
IEEE
16 years 1 months ago
Motion Estimation with Non-Local Total Variation Regularization
State-of-the-art motion estimation algorithms suffer from three major problems: Poorly textured regions, occlusions and small scale image structures. Based on the Gestalt principle...
Manuel Werlberger, Thomas Pock, Horst Bischof
CVPR
2008
IEEE
16 years 8 months ago
Discriminative learning of visual words for 3D human pose estimation
This paper addresses the problem of recovering 3D human pose from a single monocular image, using a discriminative bag-of-words approach. In previous work, the visual words are le...
Huazhong Ning, Wei Xu, Yihong Gong, Thomas S. Huan...
143
Voted
ICPR
2008
IEEE
16 years 8 months ago
Fast protein homology and fold detection with sparse spatial sample kernels
In this work we present a new string similarity feature, the sparse spatial sample (SSS). An SSS is a set of short substrings at specific spatial displacements contained in the or...
Pai-Hsi Huang, Pavel P. Kuksa, Vladimir Pavlovic