732 search results - page 94 / 147 » Termination of Integer Linear Programs |
IPL
2010
13 years 7 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
DBPL
1999
Springer
14 years 1 months ago
1999
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
ICCV
2005
IEEE
14 years 11 months ago
2005
IEEE
The goal of this work is to recover human body configurations from static images. Without assuming a priori knowledge of scale, pose or appearance, this problem is extremely chall...
CP
2009
Springer
14 years 9 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
CPM
1995
Springer
14 years 23 days ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...