1204 search results - page 157 / 241 » Termination of Polynomial Programs |
123
Voted
DAGSTUHL
1996
15 years 2 months ago
1996
A partial evaluator, given a program and a known "static" part of its input data, outputs a specialised or residual program in which computations depending only on the st...
121
Voted
OOPSLA
2005
Springer
15 years 6 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
84
Voted
ECCC
2007
15 years 18 days ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
101
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
124
Voted
ICALP
2009
Springer
16 years 28 days ago
2009
Springer
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...