Sciweavers

32 search results - page 3 / 7
» Geometric constraint solving via C-tree decomposition
Sort
View
SIAMSC
2010
158views more  SIAMSC 2010»
13 years 4 months ago
Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
In this paper, we study alternating direction methods for solving constrained total-variation image restoration and reconstruction problems. Alternating direction methods can be im...
Michael K. Ng, Pierre Weiss, Xiaoming Yuan
CCS
2010
ACM
13 years 6 months ago
Input generation via decomposition and re-stitching: finding bugs in Malware
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...
Juan Caballero, Pongsin Poosankam, Stephen McCaman...
GD
2006
Springer
13 years 9 months ago
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
Michael B. Dillencourt, David Eppstein, Michael T....
ISQED
2010
IEEE
123views Hardware» more  ISQED 2010»
13 years 7 months ago
Yield-constrained digital circuit sizing via sequential geometric programming
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...
Yu Ben, Laurent El Ghaoui, Kameshwar Poolla, Costa...
IOR
2007
106views more  IOR 2007»
13 years 5 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker