Sciweavers

7930 search results - page 605 / 1586
» Greedy in Approximation Algorithms
Sort
View
ICNP
1999
IEEE
15 years 11 months ago
A Distributed Scheduling Algorithm for Quality of Service Support in Multiaccess Networks
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which o er no QoS guarant...
Craig Barrack, Kai-Yeung Siu
UAI
2003
15 years 8 months ago
An Importance Sampling Algorithm Based on Evidence Pre-propagation
Precision achieved by stochastic sampling algorithms for Bayesian networks typically deteriorates in face of extremely unlikely evidence. To address this problem, we propose the E...
Changhe Yuan, Marek J. Druzdzel
ICCV
2009
IEEE
15 years 5 months ago
An algorithm for minimizing the Mumford-Shah functional
In this work we revisit the Mumford-Shah functional, one of the most studied variational approaches to image segmentation. The contribution of this paper is to propose an algorith...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...
ICML
2004
IEEE
16 years 8 months ago
A multiplicative up-propagation algorithm
We present a generalization of the nonnegative matrix factorization (NMF), where a multilayer generative network with nonnegative weights is used to approximate the observed nonne...
Jong-Hoon Ahn, Seungjin Choi, Jong-Hoon Oh
ICCS
2007
Springer
16 years 1 months ago
Complexity of Monte Carlo Algorithms for a Class of Integral Equations
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
Ivan Dimov, Rayna Georgieva