5785 search results - page 86 / 1157 » Approximability of Probability Distributions |
114
click to vote
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
109
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
107
Voted
COLCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
108
click to vote
ECCC
2007
15 years 1 months ago
2007
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
128
click to vote
JACM
2010
14 years 12 months ago
2010
clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a ...