2252 search results - page 357 / 451 » Lower Bounds for Dynamic Algorithms |
ALENEX
2009
13 years 6 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
PODC
2004
ACM
14 years 2 months ago
2004
ACM
We introduce the distributed gradient clock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clo...
COCO
2004
Springer
14 years 2 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
GRID
2007
Springer
14 years 25 days ago
2007
Springer
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...