Sciweavers

1225 search results - page 49 / 245
» The Instance Complexity Conjecture
Sort
View
DBPL
2005
Springer
130views Database» more  DBPL 2005»
14 years 2 months ago
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
ICALP
2010
Springer
13 years 11 months ago
Choosing, Agreeing, and Eliminating in Communication Complexity
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevit...
WSCG
2003
185views more  WSCG 2003»
13 years 10 months ago
Complex 3D Feature Registration Using a Marching Template
The registration of 3D form features is essential to the supporting of reverse shape design processes. Extracting an editable shape feature from unordered data points is notorious...
Joris S. M. Vergeest, Sander Spanjaard, Chensheng ...
BIOSYSTEMS
2007
109views more  BIOSYSTEMS 2007»
13 years 9 months ago
Complex adaptation and system structure
The structural organization of biological systems is one of nature’s most fascinating aspects, but its origin and functional role is not yet fully understood. For instance, basi...
Marc Toussaint, Werner von Seelen
IS
2008
13 years 9 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...