Sciweavers

3092 search results - page 40 / 619
» Where are you pointing
Sort
View
APPROX
2006
Springer
106views Algorithms» more  APPROX 2006»
14 years 14 days ago
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, An...
ICPR
2010
IEEE
13 years 7 months ago
A Game-Theoretic Approach to Robust Selection of Multi-View Point Correspondence
In this paper we introduce a robust matching technique that allows to operate a very accurate selection of corresponding feature points from multiple views. Robustness is achieved...
Emanuele Rodolà, Andrea Albarelli, Andrea Torsell...
DAM
2011
13 years 3 months ago
Noisy colored point set matching
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
Yago Diez, Joan Antoni Sellarès
ICASSP
2011
IEEE
13 years 13 days ago
Point process MCMC for sequential music transcription
In this paper, models and algorithms are presented for transcription of pitch and timings in polyphonic music extracts, focusing on the algorithm details of the sequential Markov ...
Pete Bunch, Simon J. Godsill
ECCV
2008
Springer
14 years 10 months ago
Learning to Recognize Activities from the Wrong View Point
Appearance features are good at discriminating activities in a fixed view, but behave poorly when aspect is changed. We describe a method to build features that are highly stable u...
Ali Farhadi, Mostafa Kamali Tabrizi