Sciweavers

224 search results - page 21 / 45
» GMRES Methods for Least Squares Problems
Sort
View
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 2 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
IJCV
1998
105views more  IJCV 1998»
13 years 8 months ago
Robust Algorithms for Object Localization
Object localization using sensed data features and corresponding model features is a fundamental problem in machine vision. We reformulate object localization as a least squares p...
Aaron S. Wallack, Dinesh Manocha
CVPR
2007
IEEE
14 years 10 months ago
Multimodal Tracking for Smart Videoconferencing and Video Surveillance
Many applications require the ability to track the 3-D motion of the subjects. We build a particle filter based framework for multimodal tracking using multiple cameras and multip...
Dmitry N. Zotkin, Vikas C. Raykar, Ramani Duraiswa...
TSP
2008
101views more  TSP 2008»
13 years 8 months ago
Subspace-Based Algorithm for Parameter Estimation of Polynomial Phase Signals
In this correspondence, parameter estimation of a polynomial phase signal (PPS) in additive white Gaussian noise is addressed. Assuming that the order of the PPS is at least 3, the...
Yuntao Wu, Hing Cheung So, Hongqing Liu
ICASSP
2010
IEEE
13 years 8 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...