Sciweavers

750 search results - page 56 / 150
» Reconstruction for Models on Random Graphs
Sort
View
MSWIM
2006
ACM
15 years 9 months ago
The power of choice in random walks: an empirical study
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...
Chen Avin, Bhaskar Krishnamachari
135
Voted
WINE
2009
Springer
383views Economy» more  WINE 2009»
15 years 10 months ago
News Posting by Strategic Users in a Social Network
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...
Mangesh Gupte, MohammadTaghi Hajiaghayi, Lu Han, L...
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
15 years 8 months ago
Radio Network Clustering from Scratch
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...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
120
Voted
NIPS
2003
15 years 4 months ago
Discriminative Fields for Modeling Spatial Dependencies in Natural Images
In this paper we present Discriminative Random Fields (DRF), a discriminative framework for the classification of natural image regions by incorporating neighborhood spatial depe...
Sanjiv Kumar, Martial Hebert
CVPR
2010
IEEE
15 years 11 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr