1021 search results - page 56 / 205 » Fast Approximate PCPs |
130
click to vote
VLSM
2005
Springer
15 years 7 months ago
2005
Springer
We develop a fast numerical method to approximate the solutions of a wide class of equations associated to the Shape From Shading problem. Our method, which is based on the control...
110
click to vote
ICPR
2002
IEEE
15 years 6 months ago
2002
IEEE
We present a new fast method of modeling 3-D objects of arbitrary topology. The Level Set Methods have been used by many researchers to recover 3-D shapes of arbitrary topology. H...
135
Voted
TSP
2010
14 years 8 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
120
click to vote
GD
2006
Springer
15 years 5 months ago
2006
Springer
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
123
click to vote
VTC
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— This paper proposes a maximum likelihood detection (MLD) method for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of ...