1424 search results - page 57 / 285 » The Multi-radius Cover Problem |
97
Voted
KDD
2009
ACM
15 years 7 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
82
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this probl...
91
Voted
WADS
2007
Springer
15 years 6 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
130
Voted
IPCO
2004
15 years 2 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
108
click to vote
ESA
2005
Springer
15 years 6 months ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...