1538 search results - page 114 / 308 » Spectral Techniques in Graph Algorithms |
GD
2004
Springer
15 years 7 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
130
click to vote
TCBB
2010
14 years 8 months ago
2010
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
130
click to vote
TAMC
2010
Springer
15 years 6 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. ...
114
click to vote
SSPR
2004
Springer
15 years 6 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
108
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...