779 search results - page 96 / 156 » Algorithms for the Sample Mean of Graphs |
126
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
129
click to vote
COMPLEX
2009
Springer
15 years 11 months ago
2009
Springer
—In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes an...
139
click to vote
AH
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The PageRank algorithm demonstrates the significance of the computation of document ranking of general importance or authority in Web information retrieval. However, doi...
157
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
166
click to vote
ISDA
2009
IEEE
15 years 11 months ago
2009
IEEE
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...