692 search results - page 128 / 139 » BDD minimization for approximate computing |
135
click to vote
ICCV
2007
IEEE
16 years 10 days ago
2007
IEEE
We present a viewpoint-based approach for the quick fusion of multiple stereo depth maps. Our method selects depth estimates for each pixel that minimize violations of visibility ...
FOCS
2009
IEEE
15 years 5 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
ALGOSENSORS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
100
click to vote
SIGECOM
2010
ACM
15 years 3 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
103
click to vote
COMGEO
2008
ACM
14 years 10 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...