Sciweavers

327 search results - page 6 / 66
» Algorithms for infinite huffman-codes
Sort
View
UAI
2008
13 years 8 months ago
Estimation and clustering with infinite rankings
This paper presents a natural extension of stagewise ranking to the the case of infinitely many items. We introduce the infinite generalized Mallows model (IGM), describe its prop...
Marina Meila, Le Bao
FORMATS
2010
Springer
13 years 5 months ago
Safraless Procedures for Timed Specifications
This paper presents extensions of Safraless algorithms proposed in the literature for automata on infinite untimed words to the case of automata on infinite timed words.
Barbara Di Giampaolo, Gilles Geeraerts, Jean-Fran&...
AAAI
1997
13 years 8 months ago
Reinforcement Learning with Time
This paper steps back from the standard infinite horizon formulation of reinforcement learning problems to consider the simpler case of finite horizon problems. Although finite ho...
Daishi Harada
JUCS
2010
124views more  JUCS 2010»
13 years 5 months ago
Finding a Consistent Scenario to an Interval Algebra Network Containing Possibly Infinite Intervals
: Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infini...
André Trudel
IJAC
2008
116views more  IJAC 2008»
13 years 7 months ago
A Nilpotent Quotient Algorithm for Certain Infinitely Presented Groups and its Applications
We describe a nilpotent quotient algorithm for a certain type of infinite presentations: the so-called finite L-presentations. We then exhibit finite L-presentations for various i...
Laurent Bartholdi, Bettina Eick, René Hartu...