Sciweavers

222 search results - page 6 / 45
» Locally Compact Path Spaces
Sort
View
67
Voted
ACS
2007
14 years 9 months ago
Choiceless, Pointless, but not Useless: Dualities for Preframes
We provide the appropriate common ‘(pre)framework’ for various central results of domain theory and topology, like the Lawson duality of continuous domains, the Hofmann–Lawso...
Marcel Erné
COMPGEOM
2006
ACM
15 years 3 months ago
Engineering a compact parallel delaunay algorithm in 3D
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version o...
Daniel K. Blandford, Guy E. Blelloch, Clemens Kado...
65
Voted
ICRA
2006
IEEE
146views Robotics» more  ICRA 2006»
15 years 3 months ago
RRT Path Planner with 3DOF Local Planner
Abstract— We present a path planning algorithm for a polyhedral robot with six degrees of freedom (6DOF) and a static obstacle. The planner consists of a dual-tree RRT algorithm ...
Jade Yang, Elisha Sacks
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
15 years 11 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
122
Voted
SISAP
2009
IEEE
159views Data Mining» more  SISAP 2009»
15 years 4 months ago
Dynamic P2P Indexing and Search Based on Compact Clustering
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Mauricio Marín, Veronica Gil Costa, Cecilia...