7430 search results - page 1110 / 1486 » Programming Applications in CIFF |
200
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
157
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Software component reuse is the software engineering practice of developing new software products from existing components. A reuse library or component reuse repository organizes...
137
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
175
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Suppose a given observation matrix can be decomposed as the sum of a low-rank matrix and a sparse matrix (outliers), and the goal is to recover these individual components from th...
164
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x...