Sciweavers

432 search results - page 8 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
PODC
2010
ACM
15 years 1 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
PODS
2004
ACM
148views Database» more  PODS 2004»
15 years 9 months ago
Deterministic Wavelet Thresholding for Maximum-Error Metrics
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
Minos N. Garofalakis, Amit Kumar
ICCS
2001
Springer
15 years 1 months ago
On Parallel Pseudo-Random Number Generation
Parallel computing has been touted as the pinnacle of high performance digital computing by many. However, many problems remain intractable using deterministic algorithms. Randomiz...
Chih Jeng Kenneth Tan
BMVC
2002
14 years 12 months ago
Real-time gesture recognition using deterministic boosting
A gesture recognition system which can reliably recognize single-hand gestures in real time on a 600Mhz notebook computer is described. The system has a vocabulary of 46 gestures ...
Raymond Lockton, Andrew W. Fitzgibbon
HPCS
2005
IEEE
15 years 3 months ago
High Performance Derivative-Free Optimization Applied to Biomedical Image Registration
Abstract— Optimization of a similarity metric is an essential component in most medical image registration approaches based on image intensities. In this paper, two new, determin...
Mark P. Wachowiak, Terry M. Peters