Sciweavers

4047 search results - page 183 / 810
» The Discrete Basis Problem
Sort
View
ECCV
1996
Springer
16 years 5 months ago
Image Recognition with Occlusions
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-redu...
Tyng-Luh Liu, Michael J. Donahue, Davi Geiger, Rob...
113
Voted
MICS
2007
84views more  MICS 2007»
15 years 2 months ago
Pseudospectra of Matrix Polynomials that Are Expressed in Alternative Bases
Spectra and pseudospectra of matrix polynomials are of interest in geometric intersection problems, vibration problems, and analysis of dynamical systems. In this note we consider ...
Robert M. Corless, Nargol Rezvani, Amirhossein Ami...
ICRA
2005
IEEE
125views Robotics» more  ICRA 2005»
15 years 9 months ago
Temporal Logic Motion Planning for Mobile Robots
— In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot...
Georgios E. Fainekos, Hadas Kress-Gazit, George J....
83
Voted
CVPR
2006
IEEE
16 years 5 months ago
Are two rotational flows sufficient to calibrate a smooth non-parametric sensor?
We present an attempt to determine whether the shape of a generic central-projection camera, such as the eye of an insect or a log-polar camera, can be determined from two motion ...
David Nistér, Etienne Grossmann, Eun-Joo Le...
150
Voted
COCOA
2009
Springer
15 years 10 months ago
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
Xianyue Li, Xiao-Hua Xu, Feng Zou, Hongwei Du, Pen...