20 search results - page 1 / 4 » Center-piece subgraphs: problem definition and fast solution... |
KDD
2006
ACM
14 years 5 months ago
2006
ACM
KDD
2004
ACM
14 years 5 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
SIAMIS
2010
12 years 11 months ago
2010
Abstract. We propose an algorithmic framework for computing global solutions of variational models with convex regularity terms that permit quite arbitrary data terms. While the mi...
BIRD
2007
Springer
13 years 11 months ago
2007
Springer
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...