Sciweavers

2636 search results - page 153 / 528
» Linear Programming
Sort
View
ICFP
2007
ACM
15 years 10 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
NIPS
2004
14 years 11 months ago
Maximum-Margin Matrix Factorization
We present a novel approach to collaborative prediction, using low-norm instead of low-rank factorizations. The approach is inspired by, and has strong connections to, large-margi...
Nathan Srebro, Jason D. M. Rennie, Tommi Jaakkola
97
Voted
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 3 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
WSC
2007
15 years 15 days ago
Mathematical programming-based perturbation analysis for GI/G/1 queues
This paper addresses several issues of using the mathematical programming representations of discrete-event dynamic systems in perturbation analysis. In particular, linear program...
He Zhang, Wai Kin Chan
ICPR
2008
IEEE
15 years 11 months ago
Graph-based classification for multiple observations of transformed patterns
We consider the problem of classification when multiple observations of a pattern are available, possibly under different transformations. We view this problem as a special case o...
Effrosini Kokiopoulou, Pascal Frossard, Stefanos P...