Sciweavers

2969 search results - page 285 / 594
» A space efficient algorithm for group structure computation
Sort
View
FOCS
2008
IEEE
15 years 11 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ACCV
2010
Springer
14 years 11 months ago
Affordance Mining: Forming Perception through Action
This work employs data mining algorithms to discover visual entities that are strongly associated to autonomously discovered modes of action, in an embodied agent. Mappings are lea...
Liam Ellis, Michael Felsberg, Richard Bowden
CVPR
2008
IEEE
16 years 6 months ago
Smoothing-based Optimization
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...
Marius Leordeanu, Martial Hebert
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 4 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
ICCV
2011
IEEE
14 years 4 months ago
Struck: Structured Output Tracking with Kernels
Adaptive tracking-by-detection methods are widely used in computer vision for tracking arbitrary objects. Current approaches treat the tracking problem as a classification task a...
Sam Hare, Amir Saffari, Philip H.S. Torr