Sciweavers

818 search results - page 49 / 164
» Network bargaining: algorithms and structural results
Sort
View
BMCBI
2006
202views more  BMCBI 2006»
13 years 8 months ago
Spectral embedding finds meaningful (relevant) structure in image and microarray data
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
Brandon W. Higgs, Jennifer W. Weller, Jeffrey L. S...
MONET
1998
94views more  MONET 1998»
13 years 7 months ago
Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support
MMWN is a modular system of link- and network-layer algorithms that enables a multihop mobile wireless network to support distributed, real-time multimedia applications. In this pa...
Ram Ramanathan, Martha Steenstrup
WWW
2009
ACM
14 years 8 months ago
Extracting community structure through relational hypergraphs
Social media websites promote diverse user interaction on media objects as well as user actions with respect to other users. The goal of this work is to discover community structu...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...
AI
2011
Springer
13 years 3 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
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