Sciweavers

1998 search results - page 348 / 400
» Complexity of the Cover Polynomial
Sort
View
ACCV
2010
Springer
13 years 5 months ago
A Direct Method for Estimating Planar Projective Transform
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
Yu-Tseh Chi, Jeffrey Ho, Ming-Hsuan Yang
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 5 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
NC
2011
201views Neural Networks» more  NC 2011»
13 years 4 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods
TSP
2011
142views more  TSP 2011»
13 years 4 months ago
Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
Antonio De Maio, Yongwei Huang, Daniel Pére...
ICASSP
2011
IEEE
13 years 1 months ago
On the identification of parametric underspread linear systems
Identification of time-varying linear systems, which introduce both time-shifts (delays) and frequency-shifts (Doppler-shifts), is a central task in many engineering applications...
Waheed U. Bajwa, Kfir Gedalyahu, Yonina C. Eldar