Sciweavers

339 search results - page 31 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
SPIN
2007
Springer
15 years 3 months ago
Generating Counter-Examples Through Randomized Guided Search
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
Neha Rungta, Eric G. Mercer
PERCOM
2005
ACM
15 years 9 months ago
Security Parallels between People and Pervasive Devices
Unique and challenging security problems arise due to the scarcity of computational, storage, and power resources in the low-cost pervasive computing environment. Particularly rel...
Stephen A. Weis
IPPS
2010
IEEE
14 years 7 months ago
Optimization of linked list prefix computations on multithreaded GPUs using CUDA
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
Zheng Wei, Joseph JáJá
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
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
14 years 9 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro