2681 search results - page 96 / 537 » Problem F |
183
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
165
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
179
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
169
click to vote
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract-- This paper introduces a convex formulation approach for the initialization of parameter estimation problems (PEP). The proposed method exploits the parameter-affine feat...
167
click to vote
DCC
2003
IEEE
16 years 5 months ago
2003
IEEE
Embedded computing systems are space and cost sensitive; memory is one of the most restricted resources, posing serious constraints on program size. Code compression, which is a s...