Sciweavers

1480 search results - page 103 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
EOR
2002
84views more  EOR 2002»
13 years 10 months ago
Solving container loading problems by block arrangement
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
Michael Eley
JPDC
2007
177views more  JPDC 2007»
13 years 10 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
CPHYSICS
2007
222views more  CPHYSICS 2007»
13 years 10 months ago
JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
A new software code for computing selected eigenvalues and associated eigenvectors of a real symmetric matrix is described. The eigenvalues are either the smallest or those closes...
Matthias Bollhöfer, Yvan Notay
IPSN
2007
Springer
14 years 4 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 5 months ago
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
Leonid Barenboim, Michael Elkin