5448 search results - page 161 / 1090 » Breakpoints and Time in Distributed Computations |
136
click to vote
CCGRID
2006
IEEE
15 years 10 months ago
2006
IEEE
As the scale of cluster computing grows, it is becoming hard for long-running applications to complete without facing failures on large-scale clusters. To address this issue, chec...
116
click to vote
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
163
click to vote
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper aims at estimating the switching time for linear switched systems, i.e. the time instant when a sub-model is switched on while another one is switched off. Assuming that...
120
click to vote
DC
2010
15 years 4 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
161
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...