Sciweavers

818 search results - page 53 / 164
» Network bargaining: algorithms and structural results
Sort
View
CORR
2010
Springer
163views Education» more  CORR 2010»
13 years 6 months ago
Faster Rates for training Max-Margin Markov Networks
Structured output prediction is an important machine learning problem both in theory and practice, and the max-margin Markov network (M3 N) is an effective approach. All state-of-...
Xinhua Zhang, Ankan Saha, S. V. N. Vishwanathan
ECAI
2008
Springer
13 years 9 months ago
An Analysis of Bayesian Network Model-Approximation Techniques
Abstract. Two approaches have been used to perform approximate inference in Bayesian networks for which exact inference is infeasible: employing an approximation algorithm, or appr...
Adamo Santana, Gregory M. Provan
ISNN
2004
Springer
14 years 1 months ago
Pattern Recognition Based on Stability of Discrete Time Cellular Neural Networks
Abstract. In this paper, some sufficient conditions are obtained to guarantee that discrete time cellular neural networks (DTCNNs) can have some stable memory patterns. These condi...
Zhigang Zeng, De-Shuang Huang, Zengfu Wang
MOBIHOC
2002
ACM
14 years 7 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
AAAI
2006
13 years 9 months ago
Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an ...
Viet Dung Dang, Rajdeep K. Dash, Alex Rogers, Nich...