1059 search results - page 31 / 212 » Improved Algorithms via Approximations of Probability Distri... |
SRDS
2008
IEEE
15 years 4 months ago
2008
IEEE
Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must ge...
DATE
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper presents a new compaction algorithm to improve the yield of IC layout. The yield is improved by reducing the area where the faults are more likely to happen known as cr...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
94
Voted
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...