Sciweavers

139 search results - page 6 / 28
» Approximations of upper and lower probabilities by measurabl...
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
15 years 10 months ago
Numerical linear algebra in the streaming model
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...
Kenneth L. Clarkson, David P. Woodruff
TSMC
2010
14 years 4 months ago
Credal Semantics of Bayesian Transformations in Terms of Probability Intervals
In this paper we propose a credal representation of the interval probability associated with a belief function (b.f.), and show how it relates to several classical Bayesian transfo...
Fabio Cuzzolin
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
15 years 4 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman
ICC
1997
IEEE
108views Communications» more  ICC 1997»
15 years 1 months ago
Overflow Probability in an ATM Queue with Self-Similar Input Traffic
Real measurements in high-speed communications networks have recently shown that traffic may demonstrate properties of long-range dependency peculiar to self-similar stochastic pr...
Boris Tsybakov, Nicolas D. Georganas
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
15 years 3 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme