348 search results - page 8 / 70 » Event tree based sampling |
SIGMOD
2011
ACM
14 years 22 days ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
AAAI
2012
13 years 9 days ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
CVPR
2008
IEEE
15 years 12 months ago
2008
IEEE
In this paper, we propose a novel robust retrieval and classification system for video and motion events based on null space representation. In order to analyze the robustness of ...
BMCBI
2010
14 years 9 months ago
2010
Background: The ever-increasing wealth of genomic sequence information provides an unprecedented opportunity for large-scale phylogenetic analysis. However, species phylogeny infe...
188
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...