2342 search results - page 327 / 469 » Sublinear geometric algorithms |
135
click to vote
IWPEC
2004
Springer
15 years 8 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
140
click to vote
CVPR
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we propose an algorithm for estimating dense depth information of dynamic scenes from multiple video streams captured using unsynchronized stationary cameras. We so...
113
click to vote
GLVLSI
2003
IEEE
15 years 8 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
123
click to vote
SENSYS
2003
ACM
15 years 8 months ago
2003
ACM
In this paper we examine the role of very simple and noisy sensors for the tracking problem. We propose a binary sensor model, where each sensor’s value is converted reliably to...
111
click to vote
ICRA
2002
IEEE
15 years 8 months ago
2002
IEEE
Effective image segmentation of a digitized scene into a set of recognizable objects requires the development of sophisticated scene analysis algorithms. Progress in this area has...