Sciweavers

10608 search results - page 1937 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 10 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 10 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
MOBISYS
2006
ACM
14 years 10 months ago
ARIADNE: a dynamic indoor signal map construction and localization system
Location determination of mobile users within a building has attracted much attention lately due to its many applications in mobile networking including network intrusion detectio...
Yiming Ji, Saad Biaz, Santosh Pandey, Prathima Agr...
PPOPP
2010
ACM
14 years 7 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
ICDE
2010
IEEE
311views Database» more  ICDE 2010»
14 years 7 months ago
Detecting Inconsistencies in Distributed Data
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
Wenfei Fan, Floris Geerts, Shuai Ma, Heiko Mü...
« Prev « First page 1937 / 2122 Last » Next »