5473 search results - page 861 / 1095 » On the graph isomorphism problem |
170
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
168
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here w...
183
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
158
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
186
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Many feature detection algorithms rely on the choice of scale. In this paper, we complement standard scaleselection algorithms with spatial regularization. To this end, we formula...