322 search results - page 54 / 65 » Least Expected Cost Query Optimization: What Can We Expect |
INFOCOM
2006
IEEE
14 years 2 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...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—There has been a recent trend that video-on-demand (VoD) providers such as Netflix are leveraging resources from cloud services for multimedia streaming. In this paper, we cons...
BMCBI
2006
13 years 8 months ago
2006
Background: Molecular evolutionary studies of noncoding sequences rely on multiple alignments. Yet how multiple alignment accuracy varies across sequence types, tree topologies, d...
DATAMINE
2010
13 years 8 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
ATAL
2000
Springer
14 years 1 months ago
2000
Springer
Agents often have preference models that are more complicated than minimizing the expected execution cost. In this paper, we study how they should act in the presence of uncertaint...