Sciweavers

3017 search results - page 526 / 604
» On compressing social networks
Sort
View
IEEECIT
2010
IEEE
13 years 8 months ago
A P2P REcommender System based on Gossip Overlays (PREGO)
—Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building an...
Matteo Mordacchini, Ranieri Baraglia, Patrizio Daz...
JDA
2010
131views more  JDA 2010»
13 years 8 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi
PVLDB
2010
152views more  PVLDB 2010»
13 years 8 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
WIOPT
2010
IEEE
13 years 8 months ago
A contracts-based approach for spectrum sharing among cognitive radios
Abstract—Development of dynamic spectrum access and allocation techniques recently have made feasible the vision of cognitive radio systems. However, a fundamental question arise...
Dileep M. Kalathil, Rahul Jain
ACL
2010
13 years 8 months ago
Structural Semantic Relatedness: A Knowledge-Based Method to Named Entity Disambiguation
Name ambiguity problem has raised urgent demands for efficient, high-quality named entity disambiguation methods. In recent years, the increasing availability of large-scale, rich...
Xianpei Han, Jun Zhao