Sciweavers

JMLR
2012
11 years 11 months ago
Primal-Dual methods for sparse constrained matrix completion
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
Yu Xin, Tommi Jaakkola
CAV
2011
Springer
253views Hardware» more  CAV 2011»
13 years 3 days ago
HAMPI: A String Solver for Testing, Analysis and Vulnerability Detection
Abstract. Many automatic testing, analysis, and verification techniques for programs can effectively be reduced to a constraint-generation phase followed by a constraint-solving ...
Vijay Ganesh, Adam Kiezun, Shay Artzi, Philip J. G...
ICCAD
1996
IEEE
80views Hardware» more  ICCAD 1996»
14 years 21 days ago
Generalized constraint generation in the presence of non-deterministic parasitics
In a constraint-drivenlayout synthesisenvironment,parasitic constraints are generated and implemented in each phase of the design process to meet a given set of performance specif...
Edoardo Charbon, Paolo Miliozzi, Enrico Malavasi, ...