Sciweavers

487 search results - page 62 / 98
» Optimal sampling algorithms for frequency estimation in dist...
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Learning Low-Density Separators
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
Shai Ben-David, Tyler Lu, Dávid Pál,...
GLOBECOM
2010
IEEE
13 years 6 months ago
Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy
Distributed and peer-to-peer storage systems are foreseen as an alternative to the traditional data centers and in-house backup solutions. In the past few years many peerto-peer st...
Frédéric Giroire, Julian Monteiro, S...
BMCBI
2010
139views more  BMCBI 2010»
13 years 8 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
BMVC
2002
13 years 11 months ago
Randomized RANSAC with T(d, d) test
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
Jiri Matas, Ondrej Chum
ILP
2004
Springer
14 years 2 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...