248 search results - page 5 / 50 » Geometrical Probability Covering Algorithm |
ICGI
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
DCC
2006
IEEE
14 years 8 months ago
2006
IEEE
Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q (0, 1). Optimal prefix...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
ACNS
2006
Springer
14 years 4 days ago
2006
Springer
A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor t...
APPROX
2006
Springer
14 years 4 days 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...