Sciweavers

525 search results - page 84 / 105
» Bidimensionality and geometric graphs
Sort
View
SPAA
2006
ACM
14 years 1 months ago
A performance analysis of local synchronization
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
Julia Lipman, Quentin F. Stout
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
14 years 1 months ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
13 years 11 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
DCOSS
2006
Springer
13 years 11 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
BMCBI
2007
118views more  BMCBI 2007»
13 years 7 months ago
A topological algorithm for identification of structural domains of proteins
Background: Identification of the structural domains of proteins is important for our understanding of the organizational principles and mechanisms of protein folding, and for ins...
Frank Emmert-Streib, Arcady R. Mushegian