2814 search results - page 87 / 563 » Competitive Analysis of Distributed Algorithms |
117
Voted
ASPDAC
2009
ACM
15 years 8 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
75
Voted
ISBI
2008
IEEE
16 years 2 months ago
2008
IEEE
We propose a novel method for axonal bouton modeling and automated detection in populations of labeled neurons, as well as bouton distribution analysis for the study of neural cir...
119
click to vote
SSS
2009
Springer
15 years 8 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
118
Voted
IEEEPACT
2005
IEEE
15 years 7 months ago
2005
IEEE
We propose a checkpoint store compression method for coarse-grain giga-scale checkpoint/restore. This mechanism can be useful for debugging, post-mortem analysis and error recover...
123
Voted
IJON
2006
15 years 2 months ago
2006
Bayesian subspace analysis has been successfully applied in face recognition. However, it suffers from its operating on a whole face difference and using one global linear subspac...