Sciweavers

598 search results - page 81 / 120
» A random graph model for massive graphs
Sort
View
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
16 years 5 days ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
ICCV
2005
IEEE
16 years 1 months ago
Incorporating Visual Knowledge Representation in Stereo Reconstruction
In this paper, we present a two-layer generative model that incorporates generic middle-level visual knowledge for dense stereo reconstruction. The visual knowledge is represented...
Adrian Barbu, Song Chun Zhu
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 13 days ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
ACMSE
2006
ACM
15 years 5 months ago
Discovering communities in complex networks
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
Hemant Balakrishnan, Narsingh Deo
TMM
2010
249views Management» more  TMM 2010»
14 years 6 months ago
Bridging the Semantic Gap Between Image Contents and Tags
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...
Hao Ma, Jianke Zhu, Michael R. Lyu, Irwin King