173 search results - page 14 / 35 » Groups with poly-context-free word problem |
ASIACRYPT
2001
Springer
13 years 11 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
ESANN
2007
13 years 9 months ago
2007
We study dimensionality reduction or feature selection in text document categorization problem. We focus on the first step in building text categorization systems, that is the cho...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Given a pair of images represented using bag-of-visual words and a label corresponding to whether the images are “related”(must-link constraint) or “unrelated” (must not li...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
The boom of product review websites, blogs and forums on the web has attracted many research efforts on opinion mining. Recently, there was a growing interest in the finergrained ...