193 search results - page 9 / 39 » Members of Random Closed Sets |
WG
1993
Springer
13 years 11 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
A set of images of a Lambertian surface under varying lighting directions defines its shape up to a three-parameter Generalized Bas-Relief (GBR) ambiguity. In this paper, we exami...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
COMBINATORICA
2010
13 years 4 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
IJCNLP
2005
Springer
14 years 28 days ago
2005
Springer
Recent work on Conditional Random Fields (CRFs) has demonstrated the need for regularisation when applying these models to real-world NLP data sets. Conventional approaches to regu...