2694 search results - page 353 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
221
click to vote
ICDCN
2011
Springer
14 years 10 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
163
click to vote
PDCN
2004
15 years 8 months ago
2004
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
173
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
145
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
200
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Two central problems in computational biology are the determination of the alignment and phylogeny of a set of biological sequences. The traditional approach to this p...