29152 search results - page 5591 / 5831 » A Model of Computation for MapReduce |
197
click to vote
SPAA
2004
ACM
16 years 1 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
179
click to vote
VRML
2004
ACM
16 years 1 days ago
2004
ACM
In this paper we present a VRML97-X3D extension to describe precomputed visibility relationships in the context of progressive transmission as well as real time visualization of m...
212
Voted
ADHOCNOW
2004
Springer
16 years 1 days ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
197
click to vote
BIRTHDAY
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
162
click to vote
DRM
2004
Springer
16 years 19 hour ago
2004
Springer
The current landscape for digital rights management (DRM) consists of various ad hoc technologies and platforms that largely focus on copy protection. The fragmented nature of the...