Sciweavers

225 search results - page 18 / 45
» Stably Computable Properties of Network Graphs
Sort
View
EUROPAR
2007
Springer
15 years 5 months ago
Acyclic Preference Systems in P2P Networks
In this work we study preference systems suitable for the Peer-to-Peer paradigm. Most of them fall in one of the three following categories: global, symmetric and complementary. Al...
Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabi...
AIRWEB
2007
Springer
15 years 6 months ago
Computing Trusted Authority Scores in Peer-to-Peer Web Search Networks
Peer-to-peer (P2P) networks have received great attention for sharing and searching information in large user communities. The open and anonymous nature of P2P networks is one of ...
Josiane Xavier Parreira, Debora Donato, Carlos Cas...
ICS
2010
Tsinghua U.
15 years 9 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
ASAP
2010
IEEE
143views Hardware» more  ASAP 2010»
15 years 1 months ago
Loop transformations for interface-based hierarchies IN SDF graphs
Data-flow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of data-flow, termed synchronous data...
Jonathan Piat, Shuvra S. Bhattacharyya, Mickaë...
HCI
2009
14 years 9 months ago
A Multiple-Aspects Visualization Tool for Exploring Social Networks
Social network analysis (SNA) has been used to study the relationships between actors in social networks, revealing their features and patterns. In most cases, nodes and edges in g...
Jie Gao, Kazuo Misue, Jiro Tanaka