Sciweavers

3229 search results - page 383 / 646
» The Theory of Timed Automata
Sort
View
PAMI
2008
146views more  PAMI 2008»
15 years 6 months ago
Optimal Randomized RANSAC
A randomized model verification strategy for RANSAC is presented. The proposed method finds, like RANSAC, a solution that is optimal with user-specified probability. The solution i...
Ondrej Chum, Jiri Matas
JCB
2007
168views more  JCB 2007»
15 years 6 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
MA
2010
Springer
140views Communications» more  MA 2010»
15 years 5 months ago
On the limiting spectral distribution of the covariance matrices of time-lagged processes
We consider two continuous-time Gaussian processes, one being partially correlated to a time-lagged version of the other. We first give the limiting spectral distribution for the ...
Christian Y. Robert, Mathieu Rosenbaum
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 4 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
CORR
2011
Springer
200views Education» more  CORR 2011»
15 years 1 months ago
Optimal Channel Training in Uplink Network MIMO Systems
We consider a multi-cell frequency-selective fading uplink channel (network MIMO) from K singleantenna user terminals (UTs) to B cooperative base stations (BSs) with M antennas ea...
Jakob Hoydis, Mari Kobayashi, Mérouane Debb...