Sciweavers

281 search results - page 46 / 57
» The Complexity of Planar Counting Problems
Sort
View
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 2 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
CSL
2009
Springer
13 years 11 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
CP
2009
Springer
14 years 8 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
PODS
2009
ACM
229views Database» more  PODS 2009»
14 years 8 months ago
Computing all skyline probabilities for uncertain data
Skyline computation is widely used in multi-criteria decision making. As research in uncertain databases draws increasing attention, skyline queries with uncertain data have also ...
Mikhail J. Atallah, Yinian Qi
DATE
2009
IEEE
138views Hardware» more  DATE 2009»
14 years 2 months ago
Hardware/software co-design architecture for thermal management of chip multiprocessors
—The sustained push for performance, transistor count, and instruction level parallelism has reached a point where chip level power density issues are at the forefront of design ...
Omer Khan, Sandip Kundu