2398 search results - page 73 / 480 » Constraint Programming and Graph Algorithms |
176
click to vote
ISPD
1997
ACM
15 years 8 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
122
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
142
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
125
click to vote
TSE
2010
15 years 3 months ago
2010
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
143
click to vote
MLG
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...