Sciweavers

481 search results - page 66 / 97
» Approximate XML Query Answers
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
COMPGEOM
1998
ACM
13 years 12 months ago
Constructing Approximate Shortest Path Maps in Three Dimensions
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
Sariel Har-Peled
DEXA
2010
Springer
180views Database» more  DEXA 2010»
13 years 8 months ago
Approximate Instance Retrieval on Ontologies
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzl...
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
13 years 7 months ago
Geographic Quorum System Approximations
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew...
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...