1101 search results - page 122 / 221 » An Algorithm for the Graph Crossing Number Problem |
135
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
151
click to vote
ICCAD
2009
IEEE
15 years 2 months ago
2009
IEEE
Double patterning technology (DPT) has emerged as the most hopeful candidate for the next technology node of the ITRS roadmap [1]. The goal of a DPT decomposer is to decompose the...
379
click to vote
COCOON
2011
Springer
14 years 4 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
187
click to vote
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
17 years 3 days ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...
110
click to vote
IRI
2007
IEEE
15 years 11 months ago
2007
IEEE
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...