Sciweavers

2877 search results - page 486 / 576
» The Complexity of Planarity Testing
Sort
View
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
SOSP
2007
ACM
14 years 7 months ago
AjaxScope: a platform for remotely monitoring the client-side behavior of web 2.0 applications
The rise of the software-as-a-service paradigm has led to the development of a new breed of sophisticated, interactive applications often called Web 2.0. While web applications ha...
Emre Kiciman, V. Benjamin Livshits
STACS
2010
Springer
14 years 5 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
SISAP
2009
IEEE
134views Data Mining» more  SISAP 2009»
14 years 5 months ago
Searching by Similarity and Classifying Images on a Very Large Scale
—In the demonstration we will show a system for searching by similarity and automatically classifying images in a very large dataset. The demonstrated techniques are based on the...
Giuseppe Amato, Pasquale Savino
IISWC
2009
IEEE
14 years 4 months ago
Experimental evaluation of N-tier systems: Observation and analysis of multi-bottlenecks
In many areas such as e-commerce, mission-critical N-tier applications have grown increasingly complex. They are characterized by non-stationary workloads (e.g., peak load several...
Simon Malkowski, Markus Hedwig, Calton Pu