Sciweavers

6568 search results - page 1220 / 1314
» Reducing the Complexity of Reductions
Sort
View
BMCBI
2005
108views more  BMCBI 2005»
15 years 6 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
SPAA
2009
ACM
16 years 7 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang

Book
352views
17 years 4 months ago
Object-Oriented Reengineering Patterns
"The documentation is missing or obsolete, and the original developers have departed. Your team has limited understanding of the system, and unit tests are missing for many, i...
Serge Demeyer, Stéphane Ducasse, Oscar Nierstrasz
ICCV
2009
IEEE
16 years 11 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
CVPR
2009
IEEE
16 years 11 months ago
Tracking of a Non-Rigid Object via Patch-based Dynamic Appearance Modeling and Adaptive Basin Hopping Monte Carlo Sampling
We propose a novel tracking algorithm for the target of which geometric appearance changes drastically over time. To track it, we present a local patch-based appearance model and p...
Junseok Kwon (Seoul National University), Kyoung M...
« Prev « First page 1220 / 1314 Last » Next »