Sciweavers

6110 search results - page 257 / 1222
» Approximate Computing
Sort
View
JAIR
2006
160views more  JAIR 2006»
15 years 6 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
SIGGRAPH
2010
ACM
15 years 11 months ago
RepFinder: Finding Approximately Repeated Scene Elements for Image Editing
Repeated elements are ubiquitous and abundant in both manmade and natural scenes. Editing such images while preserving the repetitions and their relations is nontrivial due to over...
Ming-Ming Cheng, Fang-Lue Zhang, Niloy J. Mitra, X...
INFOCOM
2011
IEEE
14 years 10 months ago
Approximation algorithms for throughput maximization in wireless networks with delay constraints
—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention start...
Guanhong Pei, V. S. Anil Kumar, Srinivasan Parthas...
SMA
2006
ACM
132views Solid Modeling» more  SMA 2006»
16 years 16 days ago
Generalized penetration depth computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
RSS
2007
134views Robotics» more  RSS 2007»
15 years 8 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha