Sciweavers

2492 search results - page 388 / 499
» False-Name-Proofness in Social Networks
Sort
View
IRCDL
2010
15 years 8 months ago
Interactive Visual Representations of Complex Information Structures
One of the most challenging issues in managing the large and diverse data available on the World Wide Web is the design of interactive systems to organize and represent information...
Gianpaolo D'Amico, Alberto Del Bimbo, Marco Meoni
SDM
2004
SIAM
229views Data Mining» more  SDM 2004»
15 years 7 months ago
R-MAT: A Recursive Model for Graph Mining
How does a `normal' computer (or social) network look like? How can we spot `abnormal' sub-networks in the Internet, or web graph? The answer to such questions is vital ...
Deepayan Chakrabarti, Yiping Zhan, Christos Falout...
CSUR
1999
159views more  CSUR 1999»
15 years 6 months ago
Hubs, authorities, and communities
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
Jon M. Kleinberg
RAS
2008
108views more  RAS 2008»
15 years 6 months ago
Towards long-lived robot genes
Robot projects are often evolutionary dead ends, with the software and hardware they produce disappearing without trace afterwards. Common causes include dependencies on uncommon ...
Paul M. Fitzpatrick, Giorgio Metta, Lorenzo Natale
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 5 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna