Sciweavers

5580 search results - page 391 / 1116
» Randomized priority algorithms
Sort
View
KAIS
2002
95views more  KAIS 2002»
15 years 7 months ago
Enhanced Proxy Caching with Content Management
In this paper, we propose a novel approach to enhancing web proxy caching, an approach that integrates content management with performance tuning techniques. We first develop a hie...
Kai Cheng, Yahiko Kambayashi
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 4 months ago
Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
Fen Zhou, Miklós Molnár, Bernard Cou...
216
Voted
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 9 months ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri
JMLR
2010
115views more  JMLR 2010»
15 years 5 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
194
Voted
ICIP
2008
IEEE
16 years 1 months ago
MAP-MRF approach for binarization of degraded document image
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
Jung Gap Kuk, Nam Ik Cho, Kyoung Mu Lee