1240 search results - page 59 / 248 » Computational Structure of coordinate transformations: A gen... |
EUROPAR
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
CONPAR
1992
15 years 1 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
We analyze information leaks in the lookup mechanisms of structured peer-to-peer anonymous communication systems and how these leaks can be used to compromise anonymity. We show t...
101
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
DAGSTUHL
2007
14 years 11 months ago
2007
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...