322 search results - page 37 / 65 » Structural and algorithmic aspects of massive social network... |
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
100
click to vote
SOCIALCOM
2010
14 years 7 months ago
2010
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...
102
click to vote
WWW
2011
ACM
14 years 4 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
122
click to vote
TAINN
2005
Springer
15 years 3 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
JMLR
2002
14 years 9 months ago
2002
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...