432 search results - page 64 / 87 » Internally deterministic parallel algorithms can be fast |
IJCV
2006
14 years 9 months ago
2006
This paper conceives of tracking as the developing distinction of a foreground against the background. In this manner, fast changes in the object or background appearance can be de...
107
click to vote
HPCA
2012
IEEE
13 years 5 months ago
2012
IEEE
Main memory latencies have always been a concern for system performance. Given that reads are on the critical path for CPU progress, reads must be prioritized over writes. However...
SAC
2009
ACM
15 years 4 months ago
2009
ACM
The prediction of the correct secondary structures of large RNAs is one of the unsolved challenges of computational molecular biology. Among the major obstacles is the fact that a...
79
Voted
ICDE
1998
IEEE
15 years 1 months ago
1998
IEEE
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
109
click to vote
PODC
2011
ACM
14 years 10 days ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...