Sciweavers

1450 search results - page 192 / 290
» On the Complexity of Hardness Amplification
Sort
View
WSDM
2010
ACM
213views Data Mining» more  WSDM 2010»
14 years 7 months ago
Corroborating Information from Disagreeing Views
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
Alban Galland, Serge Abiteboul, Amélie Mari...
ICDT
2010
ACM
211views Database» more  ICDT 2010»
14 years 7 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
EUROSYS
2010
ACM
14 years 6 months ago
Splitter: A Proxy-based Approach for Post-Migration Testing of Web Applications
The benefits of virtualized IT environments, such as compute clouds, have drawn interested enterprises to migrate their applications onto new platforms to gain the advantages of ...
Xiaoning Ding, Hai Huang, Yaoping Ruan, Anees Shai...
STACS
2010
Springer
14 years 4 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen
HYBRID
2010
Springer
14 years 4 months ago
Compositional analysis for linear control systems
The complexity of physical and engineering systems, both in terms of the governing physical phenomena and the number of subprocesses involved, is mirrored in ever more complex mat...
Florian Kerber, Arjan van der Schaft