1671 search results - page 95 / 335 » On the Covering Steiner Problem |
104
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
114
Voted
FUIN
2010
14 years 10 months ago
2010
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
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...
92
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 ...