Sciweavers

160 search results - page 17 / 32
» Towards effective partition management for large graphs
Sort
View
ALMOB
2007
170views more  ALMOB 2007»
14 years 10 months ago
A spatio-temporal mining approach towards summarizing and analyzing protein folding trajectories
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...
Hui Yang, Srinivasan Parthasarathy, Duygu Ucar
CCS
2008
ACM
14 years 12 months ago
Assessing query privileges via safe and efficient permission composition
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...
Sabrina De Capitani di Vimercati, Sara Foresti, Su...
CIKM
2008
Springer
14 years 12 months ago
Fast mining of complex time-stamped events
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 ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
CORR
2010
Springer
156views Education» more  CORR 2010»
14 years 10 months ago
On the bias of BFS
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...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
15 years 10 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
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...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...