30 search results - page 1 / 6 » Tail Estimates for the Space Complexity of Randomized Increm... |
SODA
1992
ACM
13 years 6 months ago
1992
ACM
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We consider a network of sensors deployed to sense a spatio-temporal field and infer parameters of interest about the field. We are interested in the case where each sensor's...
KDD
2010
ACM
13 years 8 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
ALGORITHMICA
1999
13 years 4 months ago
1999
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...