712 search results - page 59 / 143 » A mixture model for random graphs |
MSWIM
2006
ACM
14 years 4 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
WINE
2009
Springer
14 years 4 months ago
2009
Springer
We argue that users in social networks are strategic in how they post and propagate information. We propose two models — greedy and courteous — and study information propagatio...
FCT
2005
Springer
14 years 3 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
ESA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
NIPS
2003
13 years 11 months ago
2003
In this paper we present Discriminative Random Fields (DRF), a discriminative framework for the classification of natural image regions by incorporating neighborhood spatial depe...