Sciweavers

882 search results - page 160 / 177
» Local Search for Very Large SAT Problems
Sort
View
NIPS
2004
13 years 8 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
KDD
2004
ACM
131views Data Mining» more  KDD 2004»
14 years 7 months ago
Fast nonlinear regression via eigenimages applied to galactic morphology
Astronomy increasingly faces the issue of massive datasets. For instance, the Sloan Digital Sky Survey (SDSS) has so far generated tens of millions of images of distant galaxies, ...
Brigham Anderson, Andrew W. Moore, Andrew Connolly...
JMLR
2008
159views more  JMLR 2008»
13 years 7 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
TSMC
2008
225views more  TSMC 2008»
13 years 7 months ago
Robust Methods for Geometric Primitive Recovery and Estimation From Range Images
We present a method for the recovery of partially occluded 3D geometric primitives from range images which might also include non-primitive objects. The method uses a technique for...
Irina Lavva, Eyal Hameiri, Ilan Shimshoni
PAMI
2008
221views more  PAMI 2008»
13 years 7 months ago
Plane-Based Optimization for 3D Object Reconstruction from Single Line Drawings
In previous optimization-based methods of 3D planar-faced object reconstruction from single 2D line drawings, the missing depths of the vertices of a line drawing (and other parame...
Jianzhuang Liu, Liangliang Cao, Zhenguo Li, Xiaoou...