Sciweavers

2127 search results - page 161 / 426
» Computing large matchings fast
Sort
View
BMVC
2002
15 years 6 months ago
Invariant Features from Interest Point Groups
This paper approaches the problem of finding correspondences between images in which there are large changes in viewpoint, scale and illumination. Recent work has shown that scale...
Matthew Brown, David G. Lowe
CVPR
2005
IEEE
16 years 6 months ago
Object Detection Using 2D Spatial Ordering Constraints
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
Yan Li, Yanghai Tsin, Yakup Genc, Takeo Kanade
COMGEO
2000
ACM
15 years 4 months ago
Fast and accurate collision detection for haptic interaction using a three degree-of-freedom force-feedback device
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
Arthur D. Gregory, Ming C. Lin, Stefan Gottschalk,...
JMLR
2012
13 years 6 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 9 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu