Sciweavers

17770 search results - page 267 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
ESA
2005
Springer
125views Algorithms» more  ESA 2005»
16 years 20 days ago
Online Primal-Dual Algorithms for Covering and Packing Problems
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
Niv Buchbinder, Joseph Naor
175
Voted
MMSEC
2004
ACM
126views Multimedia» more  MMSEC 2004»
16 years 17 days ago
Key-dependency for a wavelet-based blind watermarking algorithm
When a host image is watermarked multiple times by the same algorithm collisions can occur. This makes it difficult for an image to host multiple watermarks. But this hosting is n...
Michael Brachtl, Andreas Uhl, Werner Dietl
ATAL
2008
Springer
15 years 9 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
15 years 8 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
AI
1998
Springer
15 years 6 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf