3267 search results - page 177 / 654 » Generalized quasirandom graphs |
120
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The decomposition of images into their meaningful components is one of the major tasks in computer vision. Tadmor, Nezzar and Vese [1] have proposed a general approach fo...
149
click to vote
FFA
2006
15 years 6 months ago
2006
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative La...
144
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
190
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
154
click to vote
IPL
2006
15 years 6 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing