Sciweavers

733 search results - page 107 / 147
» Recommending random walks
Sort
View
USS
2008
15 years 1 days ago
In Defense of Pseudorandom Sample Selection
Generation of random numbers is a critical component of existing post-election auditing techniques. Recent work has largely discouraged the use of all pseudorandom number generato...
Joseph A. Calandrino, J. Alex Halderman, Edward W....
MCS
2007
Springer
15 years 3 months ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
CORR
2006
Springer
125views Education» more  CORR 2006»
14 years 9 months ago
Barriers and local minima in energy landscapes of stochastic local search
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
Petteri Kaski
P2P
2010
IEEE
207views Communications» more  P2P 2010»
14 years 8 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
ICASSP
2009
IEEE
15 years 4 months ago
A compressive sensing approach to object-based surveillance video coding
This paper studies the feasibility and investigates various choices in the application of compressive sensing (CS) to object-based surveillance video coding. The residual object e...
Divya Venkatraman, Anamitra Makur