Sciweavers

420 search results - page 30 / 84
» The One-Shot Similarity Kernel
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 8 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
SDM
2009
SIAM
172views Data Mining» more  SDM 2009»
15 years 9 months ago
Travel-Time Prediction Using Gaussian Process Regression: A Trajectory-Based Approach.
This paper is concerned with the task of travel-time prediction for an arbitrary origin-destination pair on a map. Unlike most of the existing studies, which focus only on a parti...
Sei Kato, Tsuyoshi Idé
ICCV
2009
IEEE
1022views Computer Vision» more  ICCV 2009»
16 years 4 months ago
Kernelized Locality-Sensitive Hashing for Scalable Image Search
Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed high-dimensional features or complex distance fun...
Brian Kulis, Kristen Grauman
AAAI
2008
15 years 2 months ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha
CVPR
2010
IEEE
15 years 8 months ago
Locally-Parametric Pictorial Structures
Pictorial structure (PS) models are extensively used for part-based recognition of scenes, people, animals and multi-part objects. To achieve tractability, the structure and param...
Benjamin Sapp, Chris Jordan, Ben Taskar