1647 search results - page 90 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
178
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
157
click to vote
CLUSTER
2001
IEEE
15 years 8 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
157
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
133
click to vote
CCE
2004
15 years 4 months ago
2004
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
168
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...