2079 search results - page 296 / 416 » Universality of random graphs |
134
click to vote
ICPADS
2005
IEEE
15 years 10 months ago
2005
IEEE
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...
149
click to vote
TAMC
2010
Springer
15 years 9 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
145
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
162
click to vote
CVPR
2010
IEEE
16 years 25 days ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
194
click to vote
TMM
2010
14 years 11 months ago
2010
With the exponential growth of Web 2.0 applications, tags have been used extensively to describe the image contents on the Web. Due to the noisy and sparse nature in the human gene...