Sciweavers

1391 search results - page 135 / 279
» Complexity Limitations on Quantum Computation
Sort
View
CGF
2002
155views more  CGF 2002»
13 years 7 months ago
Improved Scene Reconstruction from Range Images
The modeling of real scenes is a complex and challenging task for which the use of laser rangefinders is one of the most promising approaches. Unfortunately, in many situations, i...
Jianning Wang, Manuel M. Oliveira
JMLR
2010
121views more  JMLR 2010»
13 years 2 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
12 years 11 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
12 years 11 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
12 years 11 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