1220 search results - page 30 / 244 » Minimal Interval Completions |
DATE
2002
IEEE
14 years 2 months ago
2002
IEEE
: A new technique is presented in this paper to improve the efficiency of data scheduling for multi-context reconfigurable architectures targeting multimedia and DSP applications. ...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
RC
2002
13 years 9 months ago
2002
Deterministic global optimization with interval analysis involves - using interval enclosures for ranges of the constraints, objective, and gradient to reject infeasible regions, r...
ECAL
2007
Springer
14 years 3 months ago
2007
Springer
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
JDA
2007
13 years 9 months ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...