Sciweavers

7930 search results - page 1382 / 1586
» Greedy in Approximation Algorithms
Sort
View
143
Voted
OSDI
2008
ACM
16 years 4 months ago
Probabilistic Inference in Queueing Networks
Although queueing models have long been used to model the performance of computer systems, they are out of favor with practitioners, because they have a reputation for requiring u...
Charles A. Sutton, Michael I. Jordan
ICALP
2009
Springer
16 years 4 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang
SIGMOD
2009
ACM
158views Database» more  SIGMOD 2009»
16 years 4 months ago
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Whether beloved or despised, XML Schema is momentarily the only industrially accepted schema language for XML and is unlikely to become obsolete any time soon. Nevertheless, many ...
Geert Jan Bex, Wouter Gelade, Wim Martens, Frank N...
244
Voted
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
16 years 4 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
16 years 4 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
« Prev « First page 1382 / 1586 Last » Next »