515 search results - page 50 / 103 » Layouts of Expander Graphs |
90
Voted
ICITA
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper presents an approach of using image contour recognition in the navigation for enterprise geographic information systems (GIS). The extraction of object mark images is b...
54
Voted
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
In this paper we devise an optimal deterministic algorithm for routing h-relations on-line on an N-input/output multibutterfly. The algorithm, which is obtained by generalizing th...
85
Voted
DAGSTUHL
2008
15 years 2 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
142
Voted
APAL
2011
14 years 7 months ago
2011
We formalize the construction of Paterson’s variant of the Ajtai–Koml´os–Szemer´edi sorting network of logarithmic depth in the bounded arithmetical theory VNC1 ∗ (an ex...
75
Voted
WWW
2006
ACM
16 years 1 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...