11016 search results - page 692 / 2204 » Cloud Computing for Science |
173
Voted
FOCS
2009
IEEE
16 years 2 months ago
2009
IEEE
We give an explicit construction of an -biased set over k bits of size O k 2 log(1/ ) 5/4 . This improves upon previous explicit constructions when is roughly (ignoring logarith
220
click to vote
WG
2009
Springer
16 years 2 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
199
click to vote
WG
2009
Springer
16 years 2 months ago
2009
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This class of graphs, which generalizes...
171
click to vote
CCA
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
156
click to vote
CCA
2009
Springer
16 years 2 months ago
2009
Springer
We extract a quantitative variant of uniqueness from the usual hypotheses of the implicit functions theorem. This leads not only to an a priori proof of continuity, but also to an ...