1542 search results - page 142 / 309 » The metamathematics of random graphs |
136
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
124
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
112
click to vote
ICPP
2006
IEEE
15 years 8 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
118
click to vote
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Matching and registration of shapes is a key issue in Computer Vision, Pattern Recognition, and Medical Image Analysis. This paper presents a shape representation framework based ...
141
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...