Sciweavers

712 search results - page 50 / 143
» A mixture model for random graphs
Sort
View
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 4 months ago
Maximal Scheduling in a Hypergraph Model for Wireless Networks
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
Qiao Li, Gyouhwan Kim, Rohit Negi
MVA
2008
305views Computer Vision» more  MVA 2008»
13 years 10 months ago
A new graph cut-based multiple active contour algorithm without initial contours and seed points
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
Jong-Sung Kim, Ki-Sang Hong
IM
2007
13 years 10 months ago
Growing Protean Graphs
Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...
Pawel Pralat, Nicholas C. Wormald
RSA
2008
94views more  RSA 2008»
13 years 9 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski
WAW
2010
Springer
312views Algorithms» more  WAW 2010»
13 years 8 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