Sciweavers

354 search results - page 50 / 71
» Approximate String Joins
Sort
View
BIOINFORMATICS
2011
13 years 2 months ago
Algorithms for sorting unsigned linear genomes by the DCJ operations
Motivation: The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both ...
Haitao Jiang, Binhai Zhu, Daming Zhu
SIGIR
1998
ACM
13 years 12 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
ASIACRYPT
2003
Springer
14 years 27 days ago
Accumulating Composites and Improved Group Signing
Constructing practical and provably secure group signature schemes has been a very active research topic in recent years. A group signature can be viewed as a digital signature wit...
Gene Tsudik, Shouhuai Xu
DIMVA
2009
13 years 8 months ago
Defending Browsers against Drive-by Downloads: Mitigating Heap-Spraying Code Injection Attacks
Drive-by download attacks are among the most common methods for spreading malware today. These attacks typically exploit memory corruption vulnerabilities in web browsers and brows...
Manuel Egele, Peter Wurzinger, Christopher Kruegel...
PE
2007
Springer
164views Optimization» more  PE 2007»
13 years 7 months ago
Analysis of join-the-shortest-queue routing for web server farms
Join the Shortest Queue (JSQ) is a popular routing policy for server farms. However, until now all analysis of JSQ has been limited to First-Come-First-Serve (FCFS) server farms, ...
Varun Gupta, Mor Harchol-Balter, Karl Sigman, Ward...