5785 search results - page 518 / 1157 » Approximability of Probability Distributions |
173
click to vote
CJ
2010
15 years 7 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
159
click to vote
SIGMOD
2001
ACM
16 years 7 months ago
2001
ACM
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
179
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
174
click to vote
ECML
2005
Springer
16 years 14 days ago
2005
Springer
We propose in this paper a novel approach to the induction of the structure of Hidden Markov Models. The induced model is seen as a lumped process of a Markov chain. It is construc...
217
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...