420 search results - page 26 / 84 » Some Algorithmic Problems in Polytope Theory |
102
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
ACL
2004
14 years 11 months ago
2004
This paper describes an algorithm for detecting empty nodes in the Penn Treebank (Marcus et al., 1993), finding their antecedents, and assigning them function tags, without access...
157
click to vote
Publication
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
AB
2007
Springer
15 years 1 months ago
2007
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equations. ...
JUCS
2007
14 years 9 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...