173 search results - page 19 / 35 » Groups with poly-context-free word problem |
ISW
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. Chameleon signatures are based on well established hashand-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest. Chameleon s...
CN
2004
13 years 7 months ago
2004
We consider the problem of locating nearby application peers over the Internet. We define a new peer-location scheme (called Tiers), that scales to large application peer groups. ...
SIGIR
2003
ACM
14 years 26 days ago
2003
ACM
This paper presents a novel domain-independent text segmentation method, which identifies the boundaries of topic changes in long text documents and/or text streams. The method c...
ACL
1992
13 years 8 months ago
1992
For a very long time, it has been considered that the only way of automatically extracting similar groups of words from a text collection for which no semantic information exists ...
IASTEDSEA
2004
13 years 9 months ago
2004
As software systems evolve over a series of releases, it becomes important to know which components show repeated need for maintenance. Deterioration of a single component manifes...