Sciweavers

2814 search results - page 139 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
SPAA
2010
ACM
15 years 7 months ago
Parallel approximation algorithms for facility-location problems
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
Guy E. Blelloch, Kanat Tangwongsan
138
Voted
MOBIHOC
2007
ACM
16 years 2 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
113
Voted
SPAA
2003
ACM
15 years 7 months ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd
141
Voted
JMLR
2002
160views more  JMLR 2002»
15 years 2 months ago
Kernel Independent Component Analysis
We present a class of algorithms for independent component analysis (ICA) which use contrast functions based on canonical correlations in a reproducing kernel Hilbert space. On th...
Francis R. Bach, Michael I. Jordan
134
Voted
PPOPP
2005
ACM
15 years 8 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber