1964 search results - page 126 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. There are...
ESA
2007
Springer
14 years 2 months ago
2007
Springer
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
CVPR
2003
IEEE
14 years 10 months ago
2003
IEEE
In this paper we address the problem of fast segmenting moving objects in video acquired by moving camera or more generally with a moving background. We present an approach based ...
COLT
1999
Springer
14 years 7 days ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
On the Web, where the search costs are low and the competition is just a mouse click away, it is crucial to segment the customers intelligently in order to offer more targeted and...