Sciweavers

2899 search results - page 269 / 580
» Dynamic Trees in Practice
Sort
View
VR
2007
IEEE
184views Virtual Reality» more  VR 2007»
15 years 10 months ago
Balanced Hierarchies for Collision Detection between Fracturing Objects
The simulation of fracture leads to collision-intensive situations that call for efficient collision detection algorithms and data structures. Bounding volume hierarchies (BVHs) ...
Miguel A. Otaduy, Olivier Chassot, Denis Steineman...
FOSSACS
2007
Springer
15 years 10 months ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz
WABI
2004
Springer
15 years 9 months ago
Chaining Algorithms for Alignment of Draft Sequence
Abstract. In this paper we propose a chaining method that can align a draft genomic sequence against a finished genome. We introduce the use of an overlap tree to enhance the state...
Mukund Sundararajan, Michael Brudno, Kerrin Small,...
AIPS
2006
15 years 5 months ago
Reconfigurable Path Planning for an Autonomous Unmanned Aerial Vehicle
In this paper, we present a motion planning framework for a fully deployed autonomous unmanned aerial vehicle which integrates two sample-based motion planning techniques, Probabi...
Mariusz Wzorek, Patrick Doherty
SEBD
1997
158views Database» more  SEBD 1997»
15 years 5 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...