Sciweavers

349 search results - page 22 / 70
» The Finite and the Infinite
Sort
View
IOR
2010
98views more  IOR 2010»
13 years 7 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith
TCS
2010
13 years 4 months ago
Factorization forests for infinite words and applications to countable scattered linear orderings
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
Thomas Colcombet
ICML
2007
IEEE
14 years 10 months ago
Infinite mixtures of trees
Finite mixtures of tree-structured distributions have been shown to be efficient and effective in modeling multivariate distributions. Using Dirichlet processes, we extend this ap...
Sergey Kirshner, Padhraic Smyth
AIML
2008
13 years 11 months ago
On axiomatising products of Kripke frames, part II
We generalise some results of [7, 5] and show that if L is an -modal logic (for some ordinal 3) such that (i) L contains the product logic K and (ii) the product of -many trees o...
Agi Kurucz
JMLR
2010
135views more  JMLR 2010»
13 years 4 months ago
An Exponential Model for Infinite Rankings
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
Marina Meila, Le Bao