27 search results - page 2 / 6 » Simple integer recourse models: convexity and convex approxi... |
SMA
2009
ACM
13 years 11 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
FORMATS
2007
Springer
13 years 11 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
CDC
2009
IEEE
13 years 8 months ago
2009
IEEE
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...
ASPDAC
2009
ACM
13 years 11 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...