Sciweavers

2136 search results - page 25 / 428
» Improving on Expectation Propagation
Sort
View
AAIM
2008
Springer
116views Algorithms» more  AAIM 2008»
14 years 3 months ago
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
13 years 8 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri
CP
2010
Springer
13 years 7 months ago
Propagating the Bin Packing Constraint Using Linear Programming
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
Hadrien Cambazard, Barry O'Sullivan
ICCV
2009
IEEE
15 years 22 days ago
Sparsity Induced Similarity Measure for Label Propagation
Graph-based semi-supervised learning has gained considerable interests in the past several years thanks to its effectiveness in combining labeled and unlabeled data through labe...
Hong Cheng, Zicheng Liu, Jie Yang
PSIVT
2009
Springer
135views Multimedia» more  PSIVT 2009»
14 years 1 months ago
Belief Propagation for Stereo Analysis of Night-Vision Sequences
Abstract. This paper studies different specifications of belief propagation for stereo analysis of seven rectified stereo night-vision sequences (provided by Daimler AG). As sho...
Shushi Guan, Reinhard Klette, Young Woon Woo