Sciweavers

4377 search results - page 64 / 876
» Mass problems and randomness
Sort
View
EUROCOLT
1999
Springer
15 years 2 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
JCSS
2010
146views more  JCSS 2010»
14 years 8 months ago
Connected facility location via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
ICIP
2009
IEEE
14 years 7 months ago
Random swap EM algorithm for finite mixture models in image segmentation
The Expectation-Maximization (EM) algorithm is a popular tool in statistical estimation problems involving incomplete data or in problems which can be posed in a similar form, suc...
Qinpei Zhao, Ville Hautamäki, Ismo Kärkk...
INFOCOM
2007
IEEE
15 years 4 months ago
Randomized Decentralized Broadcasting Algorithms
— We consider the problem of broadcasting a live stream of data in an unstructured network. Broadcasting has been studied extensively for networks with capacity constraints at th...
Laurent Massoulié, Andrew Twigg, Christos G...
MSS
2010
IEEE
91views Hardware» more  MSS 2010»
14 years 8 months ago
The almost surely shrinking yolk
The yolk, defined by McKelvey as the smallest ball intersecting all median hyperplanes, is a key concept in the Euclidean spatial model of voting. Koehler conjectured that the yo...
Craig A. Tovey