116 search results - page 19 / 24 » Measuring the Complexity of Join Enumeration in Query Optimi... |
102
Voted
UAI
2004
15 years 1 months ago
2004
Previous work on sensitivity analysis in Bayesian networks has focused on single parameters, where the goal is to understand the sensitivity of queries to single parameter changes...
116
Voted
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
112
click to vote
TJS
2008
14 years 11 months ago
2008
XML is a flexible and powerful tool that enables information and security sharing in heterogeneous environments. Scalable technologies are needed to effectively manage the growing...
97
Voted
TSC
2008
14 years 11 months ago
2008
Web service composition (WSC) techniques assume that the parameters used to model the environment remain static and accurate throughout the composition's execution. However, W...
106
Voted
STOC
2007
ACM
15 years 12 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...