306 search results - page 38 / 62 » On the Minimal Uncompletable Word Problem |
ISTCS
1997
Springer
13 years 11 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
SERA
2005
Springer
14 years 27 days ago
2005
Springer
: The techniques of meta-modeling and meta-levels have become a mature concept and have been largely used to solve real problems in programming languages, distributed environments,...
CVPR
2005
IEEE
13 years 9 months ago
2005
IEEE
We propose an approach to incorporating dynamic models into the human body tracking process that yields full 3– D reconstructions from monocular sequences. We formulate the trac...
DAGSTUHL
2007
13 years 8 months ago
2007
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
This paper addresses the problem of discriminative training of language models that does not require any transcribed acoustic data. We propose to minimize the conditional entropy ...