Sciweavers

2354 search results - page 187 / 471
» Randomness, Stochasticity and Approximations
Sort
View
COLT
2010
Springer
13 years 7 months ago
Sparse Recovery in Convex Hulls of Infinite Dictionaries
Let S be an arbitrary measurable space, T R and (X, Y ) be a random couple in S
Vladimir Koltchinskii, Stas Minsker
RSFDGRC
2005
Springer
100views Data Mining» more  RSFDGRC 2005»
14 years 3 months ago
A Hybrid Approach to MR Imaging Segmentation Using Unsupervised Clustering and Approximate Reducts
Abstract. We introduce a hybrid approach to magnetic resonance image segmentation using unsupervised clustering and the rules derived from approximate decision reducts. We utilize ...
Sebastian Widz, Kenneth Revett, Dominik Slezak
VMCAI
2004
Springer
14 years 3 months ago
Approximate Probabilistic Model Checking
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
Thomas Hérault, Richard Lassaigne, Fr&eacut...
STOC
1996
ACM
101views Algorithms» more  STOC 1996»
14 years 1 months ago
The Space Complexity of Approximating the Frequency Moments
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
Noga Alon, Yossi Matias, Mario Szegedy
CIARP
2004
Springer
14 years 1 months ago
New Bounds and Approximations for the Error of Linear Classifiers
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
Luís G. Rueda