1538 search results - page 155 / 308 » Spectral Techniques in Graph Algorithms |
124
click to vote
CSR
2008
Springer
15 years 5 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
201
click to vote
PODC
2011
ACM
14 years 6 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
135
click to vote
EDBT
2006
ACM
16 years 4 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
161
Voted
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Kernel machines have been shown as the state-of-the-art learning techniques for classification. In this paper, we propose a novel general framework of learning the Unified Kernel ...
158
Voted
LCPC
1994
Springer
15 years 8 months ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...