Sciweavers

376 search results - page 11 / 76
» Approximating Probability Distributions Using Small Sample S...
Sort
View
TIT
1998
70views more  TIT 1998»
13 years 7 months ago
The Importance of Convexity in Learning with Squared Loss
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...
ICIP
2008
IEEE
14 years 9 months ago
On the estimation of geodesic paths on sampled manifolds under random projections
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in highdimensional Euclidean spaces. We show that geodesic paths ...
Mona Mahmoudi, Pierre Vandergheynst, Matteo Sorci
DASFAA
2005
IEEE
136views Database» more  DASFAA 2005»
14 years 1 months ago
Distributed Intersection Join of Complex Interval Sequences
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an efficient distributed intersect...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICASSP
2010
IEEE
13 years 7 months ago
A non-iterative estimator for the concentration parameter of the relative phase distribution
In this paper, we propose an approximation of the relative phase probability function (RP pdf) and use it to find a non-iterative estimator for the concentration parameter of the...
Yothin Rakvongthai, Soontorn Oraintara
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 22 days ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang