Sciweavers

510 search results - page 90 / 102
» Searching Solitaire in Real Time
Sort
View
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
16 years 9 days ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
VLDB
2004
ACM
186views Database» more  VLDB 2004»
15 years 5 months ago
Indexing Large Human-Motion Databases
Data-driven animation has become the industry standard for computer games and many animated movies and special effects. In particular, motion capture data recorded from live actor...
Eamonn J. Keogh, Themis Palpanas, Victor B. Zordan...
GRAPHITE
2003
ACM
15 years 5 months ago
Varying rendering fidelity by exploiting human change blindness
The complexity of most virtual environments prevents them being rendered in real time even on modern graphics hardware. Knowledge of the visual system of the user viewing the envi...
Kirsten Cater, Alan Chalmers, Colin Dalton
SEMWEB
2007
Springer
15 years 5 months ago
Sampling and Soundness: Can We Have Both?
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
EAAI
2007
154views more  EAAI 2007»
14 years 11 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho