Sciweavers

1434 search results - page 121 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
IMC
2010
ACM
13 years 8 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
PPSN
2004
Springer
14 years 3 months ago
A Hybrid GRASP - Evolutionary Algorithm Approach to Golomb Ruler Search
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This...
Carlos Cotta, Antonio J. Fernández
SPAA
1998
ACM
14 years 1 months ago
Analyses of Load Stealing Models Based on Differential Equations
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
Michael Mitzenmacher
ICPR
2002
IEEE
14 years 11 months ago
Probabilistic Models for Generating, Modelling and Matching Image Categories
In this paper we present a probabilistic and continuous framework for supervised image category modelling and matching as well as unsupervised clustering of image space into image...
Hayit Greenspan, Shiri Gordon, Jacob Goldberger
ICPR
2008
IEEE
14 years 4 months ago
Detecting information-hiding in WAV audios
In this article, we propose a steganalysis method for detecting the presence of information-hiding behavior in wav audios. We extract the neighboring joint distribution features a...
Qingzhong Liu, Andrew H. Sung, Mengyu Qiao