Sciweavers

3341 search results - page 12 / 669
» On Bounded Queries and Approximation
Sort
View
TALG
2010
110views more  TALG 2010»
13 years 6 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
TACAS
2010
Springer
251views Algorithms» more  TACAS 2010»
14 years 1 months ago
Approximating the Pareto Front of Multi-criteria Optimization Problems
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
Julien Legriel, Colas Le Guernic, Scott Cotton, Od...
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
14 years 2 months ago
Derby/S: a DBMS for sample-based query answering
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
Anja Klein, Rainer Gemulla, Philipp Rösch, Wo...
ECCC
2010
124views more  ECCC 2010»
13 years 8 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
PVLDB
2010
134views more  PVLDB 2010»
13 years 6 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...