688 search results - page 113 / 138 » General Partitioning on Random Graphs |
109
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
117
Voted
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
120
click to vote
CORR
2010
Springer
15 years 17 days ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
117
click to vote
WWW
2005
ACM
16 years 1 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
108
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...