Sciweavers

3220 search results - page 299 / 644
» Constrained Graph Processes
Sort
View
JCT
2011
90views more  JCT 2011»
15 years 1 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 9 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
16 years 7 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
CCS
2009
ACM
16 years 1 months ago
Large-scale malware indexing using function-call graphs
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...
Xin Hu, Tzi-cker Chiueh, Kang G. Shin
BMCBI
2004
121views more  BMCBI 2004»
15 years 6 months ago
DEDB: a database of Drosophila melanogaster exons in splicing graph form
Background: A wealth of quality genomic and mRNA/EST sequences in recent years has provided the data required for large-scale genome-wide analysis of alternative splicing. We have...
Bernett T. K. Lee, Tin Wee Tan, Shoba Ranganathan