2100 search results - page 50 / 420 » Fundamentals of the problem |
GI
2004
Springer
14 years 3 months ago
2004
Springer
Abstract: The possibility of disconnection is one of the fundamental new networking problems presented by sensor networks. The goal of this paper is to address the problem of resul...
HPCC
2007
Springer
14 years 2 months ago
2007
Springer
Effective and efficient mapping algorithms for multisite parallel applications are fundamental to exploit the potentials of grid computing. Since the problem of optimally mapping i...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
JCIT
2007
13 years 10 months ago
2007
Our fundamental objective is to tackle the problem faced in the field of information retrieval and classification in the current era of information overflow by proposing better an...