Sciweavers

1973 search results - page 121 / 395
» The Construction of Ludic Space
Sort
View
COCO
2008
Springer
79views Algorithms» more  COCO 2008»
15 years 8 months ago
Towards Dimension Expanders over Finite Fields
In this paper we study the problem of explicitly constructing a dimension expander raised by [BISW04]: Let Fn be the n dimensional linear space over the field F. Find a small (ide...
Zeev Dvir, Amir Shpilka
UAI
2004
15 years 7 months ago
Exponential Families for Conditional Random Fields
In this paper we define conditional random fields in reproducing kernel Hilbert spaces and show connections to Gaussian Process classification. More specifically, we prove decompo...
Yasemin Altun, Alexander J. Smola, Thomas Hofmann
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 7 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
JDA
2006
106views more  JDA 2006»
15 years 6 months ago
An optimal algorithm to generate tilings
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as...
Sébastien Desreux, Eric Rémila
JSCIC
2007
100views more  JSCIC 2007»
15 years 6 months ago
Implicit-Explicit Schemes for BGK Kinetic Equations
In this work a new class of numerical methods for the BGK model of kinetic equations is presented. In principle, schemes of any order of accuracy in both space and time can be con...
Sandra Pieraccini, Gabriella Puppo