328 search results - page 50 / 66 » Algorithms for the edge-width of an embedded graph |
COMBINATORICS
2006
14 years 9 months ago
2006
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we propose a new nonlinear dimensionality reduction algorithm by adopting regularized least-square criterion on local areas of the data distribution. We first propo...
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
OWLED
2008
14 years 11 months ago
2008
Product development requires the ability to check design consistency, to verify design properties, and to answer questions about a design's possible implementations. These tas...