Sciweavers

43 search results - page 5 / 9
» Schema for Parallel Insertion and Deletion
Sort
View
STRINGOLOGY
2004
13 years 8 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö
ICDCS
2005
IEEE
14 years 1 months ago
Keyword Search in DHT-Based Peer-to-Peer Networks
Existing techniques for keyword/attribute search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unab...
Yuh-Jzer Joung, Chien-Tse Fang, Li-Wei Yang
PODC
2010
ACM
13 years 11 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
NIPS
2008
13 years 9 months ago
Bayesian Synchronous Grammar Induction
We present a novel method for inducing synchronous context free grammars (SCFGs) from a corpus of parallel string pairs. SCFGs can model equivalence between strings in terms of su...
Phil Blunsom, Trevor Cohn, Miles Osborne
ISMB
2000
13 years 8 months ago
Pattern Recognition of Genomic Features with Microarrays: Site Typing of Mycobacterium Tuberculosis Strains
Mycobacterium tuberculosis (M. tb.) strains differ in the number and locations of a transposon-like insertion sequence known as IS6110. Accurate detection of this sequence can be ...
Soumya Raychaudhuri, Joshua M. Stuart, Xuemin Liu,...