Sciweavers

11862 search results - page 180 / 2373
» Relative information completeness
Sort
View
COCO
2003
Springer
135views Algorithms» more  COCO 2003»
15 years 7 months ago
Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...
Christian Glaßer, Alan L. Selman, Samik Seng...
ICDT
2001
ACM
110views Database» more  ICDT 2001»
15 years 7 months ago
On Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
Chen Li, Edward Y. Chang
126
Voted
SIGSOFT
2006
ACM
15 years 8 months ago
Using task context to improve programmer productivity
When working on a large software system, a programmer typically spends an inordinate amount of time sifting through thousands of artifacts to find just the subset of information n...
Mik Kersten, Gail C. Murphy
TIT
2008
98views more  TIT 2008»
15 years 2 months ago
Multiuser Successive Refinement and Multiple Description Coding
We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes...
Chao Tian, Jun Chen, Suhas N. Diggavi
116
Voted
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
15 years 2 months ago
Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation"
Abstract. We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of [2]). We show that the statement of this t...
Hadrien Cambazard, Barry O'Sullivan