Sciweavers

694 search results - page 70 / 139
» Open Graphs and Computational Reasoning
Sort
View
AI
2008
Springer
13 years 10 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
3DPVT
2006
IEEE
240views Visualization» more  3DPVT 2006»
14 years 4 months ago
Global Depth from Epipolar Volumes--A General Framework for Reconstructing Non-Lambertian Surfaces
Using Epipolar Image Analysis in the context of the correspondence finding problem in depth reconstruction has several advantages. One is the elegant incorporation of prior knowl...
Timo Stich, Art Tevs, Marcus A. Magnor
SCA
2007
14 years 20 days ago
A decision network framework for the behavioral animation of virtual humans
We introduce a framework for advanced behavioral animation in virtual humans, which addresses the challenging open problem of simulating social interactions between pedestrians in...
Qinxin Yu, Demetri Terzopoulos
CORR
2011
Springer
212views Education» more  CORR 2011»
13 years 4 months ago
Path coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
Haris Aziz, Troels Bjerre Sørensen
CHI
2004
ACM
14 years 10 months ago
A commonsense approach to predictive text entry
People cannot type as fast as they think, especially when faced with the constraints of mobile devices. There have been numerous approaches to solving this problem, including rese...
Tom Stocky, Alexander Faaborg, Henry Lieberman