5595 search results - page 312 / 1119 » Approximation Algorithms for Clustering Problems |
213
click to vote
UAI
2000
15 years 8 months ago
2000
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
157
click to vote
PR
2010
15 years 5 months ago
2010
It is considered the minimum sum-of-squares clustering problem. The mathematical modeling of this problem leads to a min − sum − min formulation which, in addition to its intr...
171
click to vote
WEBI
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of retrieving multiple documents relevant to the single subtopics of a given web query, termed “full-subtopic retrieval”. To solve this problem we pres...
155
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
166
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...