563 search results - page 70 / 113 » Computing approximate PSD factorizations |
IJRR
2010
13 years 8 months ago
2010
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
COMGEO
2006
ACM
13 years 10 months ago
2006
ACM
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applica...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
MOBICOM
2006
ACM
14 years 3 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
SIGGRAPH
2010
ACM
14 years 2 months ago
2010
ACM
We present an algorithm for interactive hair rendering with both single and multiple scattering effects under complex environment lighting. The outgoing radiance due to single sca...