Sciweavers

1554 search results - page 197 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
SPIRE
1998
Springer
15 years 7 months ago
Direct Pattern Matching on Compressed Text
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
124
Voted
JSAC
2006
128views more  JSAC 2006»
15 years 3 months ago
A framework for misuse detection in ad hoc networks- part II
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
D. Subhadrabandhu, S. Sarkar, F. Anjum
CPM
2009
Springer
122views Combinatorics» more  CPM 2009»
15 years 9 months ago
Haplotype Inference Constrained by Plausible Haplotype Data
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
Michael R. Fellows, Tzvika Hartman, Danny Hermelin...
FOCS
2006
IEEE
15 years 9 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor
IJHPCA
2008
131views more  IJHPCA 2008»
15 years 3 months ago
De Novo Ultrascale Atomistic Simulations On High-End Parallel Supercomputers
We present a de novo hierarchical simulation framework for first-principles based predictive simulations of materials and their validation on high-end parallel supercomputers and ...
Aiichiro Nakano, Rajiv K. Kalia, Ken-ichi Nomura, ...