169 search results - page 7 / 34 » Distributed Approximation Algorithms for Finding 2-Edge-Conn... |
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
The Dirichlet compound multinomial (DCM) distribution, also called the multivariate Polya distribution, is a model for text documents that takes into account burstiness: the fact ...
143
click to vote
PODS
2006
ACM
16 years 1 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
COLT
2008
Springer
15 years 3 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
128
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
135
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...