Sciweavers

32545 search results - page 98 / 6509
» Data Structures and Algorithms
Sort
View
SIGMOD
2010
ACM
274views Database» more  SIGMOD 2010»
15 years 7 months ago
K-isomorphism: privacy preserving network publication against structural attacks
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
James Cheng, Ada Wai-Chee Fu, Jia Liu
109
Voted
ICDE
2007
IEEE
90views Database» more  ICDE 2007»
15 years 9 months ago
Music Recommendation Mapping and Interface Based on Structural Network Entropy
Recommendation systems generally produce the results of their output to their users in the form of an ordinal list. In the interest of simplicity, these lists are often obscure, ,...
Justin Donaldson
139
Voted
DATESO
2009
101views Database» more  DATESO 2009»
15 years 12 days ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
130
Voted
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
16 years 3 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
121
Voted
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 2 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan