Sciweavers

Share
SCP
2010
163views more  SCP 2010»
7 years 11 months ago
Compact and efficient strings for Java
In several Java VMs, strings consist of two separate objects: metadata such as the string length are stored in the actual string object, while the string characters are stored in ...
Christian Häubl, Christian Wimmer, Hanspeter ...
PVLDB
2010
195views more  PVLDB 2010»
7 years 11 months ago
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
Jiannan Wang, Guoliang Li, Jianhua Feng
ITIIS
2010
190views more  ITIIS 2010»
7 years 11 months ago
An Efficient String Matching Algorithm Using Bidirectional and Parallel Processing Structure for Intrusion Detection System
Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. ...
Gwo-Ching Chang, Yue-Der Lin
ACL
2009
8 years 2 months ago
Variational Decoding for Statistical Machine Translation
Statistical models in machine translation exhibit spurious ambiguity. That is, the probability of an output string is split among many distinct derivations (e.g., trees or segment...
Zhifei Li, Jason Eisner, Sanjeev Khudanpur
FSTTCS
2010
Springer
8 years 2 months ago
Expressiveness of streaming string transducers
Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and us...
Rajeev Alur, Pavol Cerný
WABI
2010
Springer
143views Bioinformatics» more  WABI 2010»
8 years 2 months ago
Swiftly Computing Center Strings
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
Franziska Hufsky, Léon Kuchenbecker, Kathar...
SPIRE
2010
Springer
8 years 2 months ago
Counting and Verifying Maximal Palindromes
Abstract. A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is r...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
SPIRE
2010
Springer
8 years 2 months ago
Succinct Representations of Dynamic Strings
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
Meng He, J. Ian Munro
KBSE
2010
IEEE
8 years 2 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
IPL
2010
107views more  IPL 2010»
8 years 2 months ago
Disjoint pattern matching and implication in strings
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...
Leonid Libkin, Cristina Sirangelo
books