Sciweavers

1243 search results - page 132 / 249
» On the locality of bounded growth
Sort
View
ML
2012
ACM
385views Machine Learning» more  ML 2012»
14 years 2 months ago
An alternative view of variational Bayes and asymptotic approximations of free energy
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
Kazuho Watanabe
DATE
2009
IEEE
118views Hardware» more  DATE 2009»
16 years 1 months ago
Gate sizing for large cell-based designs
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...
Stephan Held
ICASSP
2008
IEEE
16 years 27 days ago
Admissible stopping in viterbi beam search for unit selection in concatenative speech synthesis
Corpus-based concatenative speech synthesis is very popular these days due to its highly natural speech quality. The amount of computation required in the run time, however, is of...
Shinichi Sakai, Tatsuya Kawahara, Shun Nakamura
GLOBECOM
2006
IEEE
16 years 15 days ago
A Distributed Size-bounded Multi-hop Clustering for Mobile Ad Hoc Networks
— During the last few years there has been a rapid development in mobile ad hoc networks (MANETs). To make the operations of a MANET more efficient, one approach is to construct...
Yong Wang, Muralidhar Medidi
IPSN
2005
Springer
15 years 12 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu