Sciweavers

427 search results - page 34 / 86
» Sequential predictions based on algorithmic complexity
Sort
View
ATAL
2008
Springer
15 years 4 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
126
Voted
UAI
2008
15 years 4 months ago
Continuous Time Dynamic Topic Models
In this paper, we develop the continuous time dynamic topic model (cDTM). The cDTM is a dynamic topic model that uses Brownian motion to model the latent topics through a sequenti...
Chong Wang, David M. Blei, David Heckerman
ICGI
2000
Springer
15 years 6 months ago
Computation of Substring Probabilities in Stochastic Grammars
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
Ana L. N. Fred
DCC
2004
IEEE
16 years 2 months ago
Efficient Bit Allocation for Dependent Video Coding
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
Yegnaswamy Sermadevi, Sheila S. Hemami
102
Voted
ICPPW
2005
IEEE
15 years 8 months ago
A Practical Approach to the Rating of Barrier Algorithms Using the LogP Model and Open MPI
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...
Torsten Hoefler, Lavinio Cerquetti, Torsten Mehlan...