Sciweavers

683 search results - page 128 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
14 years 2 months ago
Mining mutation chains in biological sequences
— The increasing infectious disease outbreaks has led to a need for new research to better understand the disease’s origins, epidemiological features and pathogenicity caused b...
Chang Sheng, Wynne Hsu, Mong-Li Lee, Joo Chuan Ton...
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
13 years 11 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
AAAI
2008
13 years 10 months ago
Planning for Human-Robot Interaction Using Time-State Aggregated POMDPs
In order to interact successfully in social situations, a robot must be able to observe others' actions and base its own behavior on its beliefs about their intentions. Many ...
Frank Broz, Illah R. Nourbakhsh, Reid G. Simmons
CG
2008
Springer
13 years 7 months ago
Practical global illumination for interactive particle visualization
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resul...
Christiaan P. Gribble, Carson Brownlee, Steven G. ...
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 2 days ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie