2398 search results - page 308 / 480 » Constraint Programming and Graph Algorithms |
209
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
186
click to vote
ICCAD
2003
IEEE
15 years 11 months ago
2003
IEEE
: This paper presents FROSTY, a computer program for automatically extracting the hierarchy of a large-scale digital CMOS circuit from its transistor-level netlist description and ...
183
click to vote
JMLR
2012
13 years 8 months ago
2012
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
147
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
148
click to vote
ICIP
2000
IEEE
16 years 7 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...