Sciweavers

6110 search results - page 401 / 1222
» Approximate Computing
Sort
View
ICIP
2000
IEEE
16 years 8 months ago
3-D Reconstruction of Real-World Objects Using Extended Voxels
In this paper we present a voxel-based 3-D reconstruction technique that computes a set of non-transparent object surface voxels from a given set of calibrated camera views. We sh...
Eckehard G. Steinbach, Bernd Girod, Peter Eisert, ...
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 6 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
JCNS
2010
104views more  JCNS 2010»
15 years 5 months ago
A new look at state-space models for neural data
State space methods have proven indispensable in neural data analysis. However, common methods for performing inference in state-space models with non-Gaussian observations rely o...
Liam Paninski, Yashar Ahmadian, Daniel Gil Ferreir...
192
Voted
SI3D
1997
ACM
15 years 11 months ago
Model Simplification Using Vertex-Clustering
This paper presents a practical technique to automatically compute approximations of polygonal representations of 3D objects. It is based on a previously developed model simplific...
Kok-Lim Low, Tiow Seng Tan
FOCS
2004
IEEE
15 years 10 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...