5448 search results - page 802 / 1090 » Breakpoints and Time in Distributed Computations |
195
click to vote
HPCN
1998
Springer
15 years 11 months ago
1998
Springer
Unstructured grids can represent the complex geometry of the ocean basin with high delity. The lack of development tools supporting irregular grid problems discourages the use of ...
154
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
159
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
165
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
179
Voted
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...