Sciweavers

1604 search results - page 227 / 321
» Approximation algorithms for developable surfaces
Sort
View
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 1 months ago
Mean field for Markov Decision Processes: from Discrete to Continuous Optimization
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
Nicolas Gast, Bruno Gaujal, Jean-Yves Le Boudec
CGF
2007
113views more  CGF 2007»
15 years 1 months ago
Real-time homogenous translucent material editing
This paper presents a novel method for real-time homogenous translucent material editing under fixed illumination. We consider the complete analytic BSSRDF model proposed by Jens...
Kun Xu, Yue Gao, Yong Li, Tao Ju, Shi-Min Hu
111
Voted
JMLR
2006
145views more  JMLR 2006»
15 years 1 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
MOBIHOC
2010
ACM
14 years 11 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
ICASSP
2009
IEEE
14 years 11 months ago
Weighted nonnegative matrix factorization
Nonnegative matrix factorization (NMF) is a widely-used method for low-rank approximation (LRA) of a nonnegative matrix (matrix with only nonnegative entries), where nonnegativity...
Yong-Deok Kim, Seungjin Choi