160 search results - page 17 / 32 » Towards effective partition management for large graphs |
119
Voted
ALMOB
2007
15 years 11 days ago
2007
Understanding the protein folding mechanism remains a grand challenge in structural biology. In the past several years, computational theories in molecular dynamics have been empl...
117
Voted
CCS
2008
ACM
15 years 2 months ago
2008
ACM
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
112
Voted
CIKM
2008
Springer
15 years 2 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 ...
CORR
2010
Springer
15 years 10 days ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
114
Voted
KDD
2008
ACM
16 years 20 days ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...