Sciweavers

265 search results - page 14 / 53
» Generating an Assortative Network with a Given Degree Distri...
Sort
View
JMLR
2006
118views more  JMLR 2006»
13 years 8 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
IPPS
2003
IEEE
14 years 1 months ago
Energy Aware Scheduling for Distributed Real-Time Systems
Power management has become popular in mobile computing as well as in server farms. Although a lot of work has been done to manage the energy consumption on uniprocessor real-time...
Ramesh Mishra, Namrata Rastogi, Dakai Zhu, Daniel ...
IM
2008
13 years 8 months ago
Directed Random Dot Product Graphs
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
Stephen J. Young, Edward R. Scheinerman
ICOIN
2007
Springer
14 years 2 months ago
Analyzing and Modeling Router-Level Internet Topology
Measurement studies on the Internet topology show that connectivities of nodes exhibit power–law attribute, but it is apparent that only the degree distribution does not determin...
Ryota Fukumoto, Shin'ichi Arakawa, Tetsuya Takine,...
WAW
2010
Springer
312views Algorithms» more  WAW 2010»
13 years 6 months ago
The Geometric Protean Model for On-Line Social Networks
We introduce a new geometric, rank-based model for the link structure of on-line social networks (OSNs). In the geo-protean (GEO-P) model for OSNs nodes are identified with points ...
Anthony Bonato, Jeannette Janssen, Pawel Pralat