Sciweavers

895 search results - page 133 / 179
» Approximate convex decomposition
Sort
View
UAI
2004
14 years 11 months ago
Recovering Articulated Object Models from 3D Range Data
We address the problem of unsupervised learning of complex articulated object models from 3D range data. We describe an algorithm whose input is a set of meshes corresponding to d...
Dragomir Anguelov, Daphne Koller, Hoi-Cheung Pang,...
ATAL
2011
Springer
13 years 9 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
PODS
2004
ACM
148views Database» more  PODS 2004»
15 years 9 months ago
Deterministic Wavelet Thresholding for Maximum-Error Metrics
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
Minos N. Garofalakis, Amit Kumar
ICIP
2001
IEEE
15 years 11 months ago
On the compression of two-dimensional piecewise smooth functions
It is well known that wavelets provide good non-linear approximation of one-dimensional (1-D) piecewise smooth functions. However, it has been shown that the use of a basis with g...
Pier Luigi Dragotti, Minh N. Do, Rahul Shukla, Mar...
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
15 years 10 months ago
Lower-stretch spanning trees
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...