Sciweavers

2233 search results - page 404 / 447
» On the Complexity of Theory Curbing
Sort
View
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 2 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
LCTRTS
2010
Springer
14 years 2 months ago
Sampling-based program execution monitoring
For its high overall cost during product development, program debugging is an important aspect of system development. Debugging is a hard and complex activity, especially in time-...
Sebastian Fischmeister, Yanmeng Ba
SPAA
2009
ACM
14 years 2 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
BIRTHDAY
2009
Springer
14 years 2 months ago
Is the World Linear?
Super-resolution is the art of creating nice high-resolution raster images from given low-resolution raster images. Since “nice” is not a well-defined term in mathematics and ...
Rudolf Fleischer
FOCS
2009
IEEE
14 years 2 months ago
A Parallel Repetition Theorem for Any Interactive Argument
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...
Iftach Haitner