Sciweavers

4536 search results - page 190 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ISAAC
2004
Springer
121views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Approximate Distance Oracles for Graphs with Dense Clusters
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
Mattias Andersson, Joachim Gudmundsson, Christos L...
ESA
2008
Springer
73views Algorithms» more  ESA 2008»
13 years 11 months ago
On the Size of the 3D Visibility Skeleton: Experimental Results
Abstract. The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for k con...
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Chri...
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
13 years 8 months ago
Planning short paths with clearance using explicit corridors
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
Roland Geraerts
SEMWEB
2009
Springer
14 years 4 months ago
Using Naming Authority to Rank Data and Ontologies for Web Search
Abstract. The focus of web search is moving away from returning relevant documents towards returning structured data as results to user queries. A vital part in the architecture of...
Andreas Harth, Sheila Kinsella, Stefan Decker
VLDB
1991
ACM
143views Database» more  VLDB 1991»
14 years 1 months ago
Handling Data Skew in Multiprocessor Database Computers Using Partition Tuning
Shared nothing multiprocessor archit.ecture is known t.obe more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particu...
Kien A. Hua, Chiang Lee