Sciweavers

767 search results - page 72 / 154
» On Clustering Using Random Walks
Sort
View
FOCS
2000
IEEE
15 years 6 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 4 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
IROS
2007
IEEE
107views Robotics» more  IROS 2007»
15 years 8 months ago
Visibility in motion
Abstract— We address the problem of determining and obtaining the visibility of a moving target from multiple angles using a mobile robot. The pursuer uses a modified form of pu...
Esra Kadioglu Urtis, Loren Fiore, Nikolaos Papanik...
123
Voted
IWDW
2004
Springer
15 years 7 months ago
A Multi-feature Based Invertible Authentication Watermarking for JPEG Images
: Invertible authentication techniques have been used in some special applications (such as medical or military) where original data can be recovered after authenticated. In this p...
Deng-Pan Ye, Yaobin Mao, Yuewei Dai, Zhiquan Wang
127
Voted
CSR
2010
Springer
15 years 7 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning