Sciweavers

1612 search results - page 75 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
CP
1999
Springer
15 years 2 months ago
Optimal Distributed Arc-Consistency
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
Youssef Hamadi
ICMCS
2006
IEEE
100views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Distributed Media Rate Allocation in Overlay Networks
We address the problem of distributed path selection and rate allocation for media streaming in overlay networks. Under the assumption that each node has only a local view of the ...
Dan Jurca, Pascal Frossard
ICML
2007
IEEE
15 years 10 months ago
Conditional random fields for multi-agent reinforcement learning
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanat...
CAIP
2001
Springer
293views Image Analysis» more  CAIP 2001»
15 years 2 months ago
A Markov Random Field Image Segmentation Model Using Combined Color and Texture Features
In this paper, we propose a Markov random field (MRF) image segmentation model which aims at combining color and texture features. The theoretical framework relies on Bayesian est...
Zoltan Kato, Ting-Chuen Pong
EMNLP
2007
14 years 11 months ago
Lexical Semantic Relatedness with Random Graph Walks
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...
Thad Hughes, Daniel Ramage