4315 search results - page 185 / 863 » Sorting in linear time |
SIAMIS
2010
13 years 4 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
ECCV
2010
Springer
14 years 2 months ago
2010
Springer
This paper presents a linear solution for reconstructing the 3D trajectory of a moving point from its correspondence in a collection of 2D perspective images, given the 3D spatial ...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
We propose a method that dramatically improves the performance of template-based matching in terms of size of convergence region and computation time. This is done by selecting a ...
ICARCV
2008
IEEE
14 years 3 months ago
2008
IEEE
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...