Sciweavers

5448 search results - page 634 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
ICS
2010
Tsinghua U.
16 years 4 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
SAC
2011
ACM
14 years 9 months ago
An empirical study on the effectiveness of time-aware test case prioritization techniques
Regression testing is often performed with a time budget and it does not allow executing all test cases. Test case prioritization techniques re-order test cases to increase the ra...
Dongjiang You, Zhenyu Chen, Baowen Xu, Bin Luo, Ch...
ICPR
2000
IEEE
16 years 8 months ago
A Parallel Algorithm for Tracking of Segments in Noisy Edge Images
We present a parallel implementation of a probabilistic algorithm for real time tracking of segments in noisy edge images. Given an initial solution ?a set of segments that reason...
Pedro E. López-de-Teruel, Alberto Ruiz, Jos...
MOBIHOC
2007
ACM
16 years 6 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
ICPP
2009
IEEE
16 years 1 months ago
Accelerating Lattice Boltzmann Fluid Flow Simulations Using Graphics Processors
—Lattice Boltzmann Methods (LBM) are used for the computational simulation of Newtonian fluid dynamics. LBM-based simulations are readily parallelizable; they have been implemen...
Peter Bailey, Joe Myre, Stuart D. C. Walsh, David ...