692 search results - page 87 / 139 » BDD minimization for approximate computing |
INFORMS
1998
14 years 10 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
122
Voted
SIAMJO
2010
14 years 9 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
79
Voted
GBRPR
2007
Springer
15 years 2 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
74
Voted
SAGT
2009
Springer
15 years 5 months ago
2009
Springer
We study economic means to improve network performance in the well-known game theoretic traffic model due to Wardrop. We introduce two sorts of spam flow - auxiliary and adversari...
93
Voted
FSTTCS
2007
Springer
15 years 5 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...