Sciweavers

2681 search results - page 96 / 537
» Problem F
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 8 months ago
Is submodularity testable?
: 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 ...
C. Seshadhri, Jan Vondrák
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
14 years 1 months ago
Code Compaction Using Genetic Algorithms
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...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
14 years 10 months ago
A nearly optimal oracle for avoiding failed vertices and edges
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...
Aaron Bernstein, David R. Karger
CDC
2008
IEEE
133views Control Systems» more  CDC 2008»
13 years 10 months ago
A nonlinear least squares estimation procedure without initial parameter guesses
Abstract-- This paper introduces a convex formulation approach for the initialization of parameter estimation problems (PEP). The proposed method exploits the parameter-affine feat...
Julian Bonilla Alarcon, Moritz Diehl, Bart De Moor...
DCC
2003
IEEE
14 years 9 months ago
Code Compression Using Variable-to-fixed Coding Based on Arithmetic Coding
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...
Yuan Xie, Wayne Wolf, Haris Lekatsas