Sciweavers

2491 search results - page 473 / 499
» De-anonymizing Social Networks
Sort
View
CIKM
2007
Springer
14 years 5 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
40
Voted
MOBICOM
2006
ACM
14 years 4 months ago
Analysis and implications of student contact patterns derived from campus schedules
Characterizing mobility or contact patterns in a campus environment is of interest for a variety of reasons. Existing studies of these patterns can be classified into two basic a...
Vikram Srinivasan, Mehul Motani, Wei Tsang Ooi
WINE
2005
Springer
161views Economy» more  WINE 2005»
14 years 4 months ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 3 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 3 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...