1017 search results - page 64 / 204 » On the Power of k -Consistency |
141
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
138
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
176
click to vote
KES
2004
Springer
15 years 11 months ago
2004
Springer
– This paper describes a text categorization approach that is based on a combination of a newly designed text representation with a kNN classifier. The new text document represen...
169
click to vote
JDA
2008
15 years 5 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
180
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...