Sciweavers

1236 search results - page 83 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
ISSS
2000
IEEE
109views Hardware» more  ISSS 2000»
15 years 2 months ago
Verification of Embedded Systems using a Petri Net based Representation
The ever increasing complexity of embedded systems consisting of hardware and software components poses a challenge in verifying their correctness, New verification methods that o...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
JMLR
2010
121views more  JMLR 2010»
14 years 4 months ago
Efficient Collapsed Gibbs Sampling for Latent Dirichlet Allocation
Collapsed Gibbs sampling is a frequently applied method to approximate intractable integrals in probabilistic generative models such as latent Dirichlet allocation. This sampling ...
Han Xiao, Thomas Stibor
ICASSP
2011
IEEE
14 years 1 months ago
Improving the performance of DSP systems for MIMO processing
While the research into MIMO communications algorithms have reached levels of development that show important wireless systems performance improvements, the development of DSP sys...
Nathaniel Horner, Andres Kwasinski, Antonio Mondra...
ICASSP
2011
IEEE
14 years 1 months ago
Using F0 to constrain the unit selection Viterbi network
The goal of the work described here is to limit the computation needed in unit selection Viterbi search for text-to-speech synthesis. The broader goal is to improve speech quality...
Alistair Conkie, Ann K. Syrdal
INFOCOM
2011
IEEE
14 years 1 months ago
Scalable and fully distributed localization with mere connectivity
Abstract—This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and non-uniform nodal distributio...
Miao Jin, Su Xia, Hongyi Wu, Xianfeng Gu