173 search results - page 13 / 35 » Groups with poly-context-free word problem |
NIPS
2007
14 years 11 months ago
2007
In recent years, the language model Latent Dirichlet Allocation (LDA), which clusters co-occurring words into topics, has been widely applied in the computer vision field. Howeve...
100
click to vote
ICVGIP
2004
14 years 11 months ago
2004
Searching in scanned documents is an important problem in Digital Libraries. If OCRs are not available, the scanned images are inaccessible. In this paper, we demonstrate a search...
123
click to vote
LICS
2000
IEEE
15 years 2 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
ACCV
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...