Sciweavers

49 search results - page 9 / 10
» A parallel algorithmic version of the Local Lemma
Sort
View
JPDC
2008
134views more  JPDC 2008»
13 years 9 months ago
Middleware for data mining applications on clusters and grids
This paper gives an overview of two middleware systems that have been developed over the last 6 years to address the challenges involved in developing parallel and distributed imp...
Leonid Glimcher, Ruoming Jin, Gagan Agrawal
ECCC
2010
122views more  ECCC 2010»
13 years 8 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
SPAA
2010
ACM
14 years 2 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
WOB
2004
120views Bioinformatics» more  WOB 2004»
13 years 11 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...
DAGSTUHL
2006
13 years 11 months ago
Decentralization and Mechanism Design for Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
Birgit Heydenreich, Rudolf Müller, Marc Uetz