Sciweavers

2695 search results - page 431 / 539
» Learning Graph Matching
Sort
View
111
Voted
WWW
2005
ACM
16 years 3 months ago
G-ToPSS: fast filtering of graph-based metadata
RDF is increasingly being used to represent metadata. RDF Site Summary (RSS) is an application of RDF on the Web that has considerably grown in popularity. However, the way RSS sy...
Milenko Petrovic, Haifeng Liu, Hans-Arno Jacobsen
WWW
2003
ACM
16 years 3 months ago
Scaling personalized web search
Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's P...
Glen Jeh, Jennifer Widom
KDD
2009
ACM
150views Data Mining» more  KDD 2009»
16 years 3 months ago
Large human communication networks: patterns and a utility-driven generator
Given a real, and weighted person-to-person network which changes over time, what can we say about the cliques that it contains? Do the incidents of communication, or weights on t...
Nan Du, Christos Faloutsos, Bai Wang, Leman Akoglu
RECOMB
2007
Springer
16 years 2 months ago
QNet: A Tool for Querying Protein Interaction Networks
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
Banu Dost, Tomer Shlomi, Nitin Gupta 0002, Eytan R...
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 2 months ago
Fully-dynamic min-cut
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
Mikkel Thorup