Sciweavers

196 search results - page 31 / 40
» Approximating weighted matchings in parallel
Sort
View
99
Voted
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 3 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
HPDC
2007
IEEE
15 years 4 months ago
Using content-addressable networks for load balancing in desktop grids
Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently mat...
Jik-Soo Kim, Peter J. Keleher, Michael A. Marsh, B...
IPPS
2002
IEEE
15 years 2 months ago
Static Mapping Heuristics for Tasks with Dependencies, Priorities, Deadlines, and Multiple Versions in Heterogeneous Environment
Heterogeneous computing (HC) environments composed of interconnected machines with varied computational capabilities are well suited to meet the computational demands of large, di...
Tracy D. Braun, Howard Jay Siegel, Anthony A. Maci...
NIPS
2007
14 years 11 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
INFOCOM
2002
IEEE
15 years 2 months ago
Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches
— High-aggregate bandwidth switches are those whose port count multiplied by the operating line rate is very high; for example, a 30 port switch operating at 40 Gbps or a 1000 po...
Paolo Giaccone, Balaji Prabhakar, Devavrat Shah