2233 search results - page 404 / 447 » On the Complexity of Theory Curbing |
184
click to vote
EDBT
2010
ACM
16 years 29 days ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
167
click to vote
LCTRTS
2010
Springer
16 years 29 days ago
2010
Springer
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-...
160
click to vote
SPAA
2009
ACM
16 years 28 days ago
2009
ACM
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...
153
click to vote
BIRTHDAY
2009
Springer
16 years 28 days ago
2009
Springer
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 ...
155
click to vote
FOCS
2009
IEEE
16 years 26 days ago
2009
IEEE
— 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...