Sciweavers

1612 search results - page 60 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
CLUSTER
2011
IEEE
13 years 9 months ago
A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks
  In the last decade, numerous efforts have been devoted to design efficient algorithms for clustering the  wireless mobile ad‐hoc networks (MANET) consider...
Javad Akbari Torkestani, Mohammad Reza Meybodi
ICS
1998
Tsinghua U.
15 years 2 months ago
Techniques for Empirical Testing of Parallel Random Number Generators
Parallel computers are now commonly used for computational science and engineering, and many applications in these areas use random number generators. For some applications, such ...
Paul D. Coddington, Sung Hoon Ko
ICCV
2009
IEEE
1048views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Face Recognition With Contiguous Occlusion Using Markov Random Fields
Partially occluded faces are common in many applications of face recognition. While algorithms based on sparse representation have demonstrated promising results, they achieve t...
Zihan Zhou, Andrew Wagner, Hossein Mobahi, John Wr...
ICDT
2005
ACM
124views Database» more  ICDT 2005»
15 years 3 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
AAAI
1997
14 years 11 months ago
Summarizing CSP Hardness with Continuous Probability Distributions
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
Daniel Frost, Irina Rish, Lluís Vila