Sciweavers

10988 search results - page 2016 / 2198
» Algorithmic Folding Complexity
Sort
View
143
Voted
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 3 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...
136
Voted
MOBISYS
2006
ACM
16 years 3 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
16 years 26 days 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...
132
Voted
ICDE
2010
IEEE
311views Database» more  ICDE 2010»
16 years 24 days 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ü...
144
Voted
EUROSYS
2006
ACM
16 years 21 days ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
« Prev « First page 2016 / 2198 Last » Next »