1552 search results - page 28 / 311 » On the Complexity of Constant Propagation |
MOC
2000
15 years 1 months ago
2000
This article considers the problem of evaluating all pure and mixed partial derivatives of some vector function defined by an evaluation procedure. The natural approach to evaluati...
129
click to vote
ICCV
2001
IEEE
16 years 3 months ago
2001
IEEE
We present a new technique that improves upon existing structure from motion (SFM) methods. We propose a SFM algorithm that is both recursive and optimal. Our method incorporates ...
AAAI
2007
15 years 4 months ago
2007
We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorith...
167
click to vote
AML
2011
14 years 9 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
135
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...