Sciweavers

3368 search results - page 187 / 674
» The Complexity of Query Reliability
Sort
View
VLDB
2002
ACM
161views Database» more  VLDB 2002»
15 years 6 months ago
BANKS: Browsing and Keyword Searching in Relational Databases
The BANKS system enables keyword-based search on databases, together with data and schema browsing. BANKS enables users to extract information in a simple manner without any knowl...
B. Aditya, Gaurav Bhalotia, Soumen Chakrabarti, Ar...
GIS
2010
ACM
15 years 5 months ago
Decentralized querying of topological relations between regions without using localization
This paper proposes an efficient, decentralized algorithm for determining the topological relationship between two regions monitored by a geosensor network. Many centralized algo...
Matt Duckham, Myeong Hun Jeong, Sanjiang Li, Joche...
STACS
2007
Springer
16 years 18 days ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
16 years 1 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
ISAAC
2009
Springer
130views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Counting in the Presence of Memory Faults
The faulty memory RAM presented by Finocchi and Italiano [1] is a variant of the RAM model where the content of any memory cell can get corrupted at any time, and corrupted cells c...
Gerth Stølting Brodal, Allan Grønlun...