Sciweavers

327 search results - page 39 / 66
» Algorithms for infinite huffman-codes
Sort
View
AAAI
2008
13 years 9 months ago
Optimal Metric Planning with State Sets in Automata Representation
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
Björn Ulrich Borowsky, Stefan Edelkamp
EPEW
2006
Springer
13 years 9 months ago
The Impact of Buffer Finiteness on the Loss Rate in a Priority Queueing System
This paper discusses five different ways to approximate the loss rate in a fundamental two class priority system, where each class has its own finite capacity buffer, as well as an...
Jeroen Van Velthoven, Benny Van Houdt, Chris Blond...
CIC
2006
124views Communications» more  CIC 2006»
13 years 8 months ago
Comments on the Channel Capacity of Ethernet
Ethernet is the most widely used network and many analytical models were developed to predict its capacity. Usually in these models assumptions like infinite population, no back-of...
Maher Heal
IC
2004
13 years 8 months ago
Area-Efficient Visualization of Web Data
With the explosion of the Internet the World Wide Web today has become an infinite source of information. Hence, it is important that one be able to categorize, understand and be a...
Vishal Anand, Keith Hansen, Radu Jianu, Adrian Rus...
NIPS
2001
13 years 8 months ago
Latent Dirichlet Allocation
We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian m...
David M. Blei, Andrew Y. Ng, Michael I. Jordan