Sciweavers

287 search results - page 2 / 58
» UDS: A Universal Data Structure
Sort
View
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
13 years 3 months ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
Francois Carouge, Michael F. Spear
SPAA
2010
ACM
13 years 5 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 9 days ago
A Universal Part-of-Speech Tagset
To facilitate future research in unsupervised induction of syntactic structure and to standardize best-practices, we propose a tagset that consists of twelve universal part-ofspee...
Slav Petrov, Dipanjan Das, Ryan McDonald
POPL
2011
ACM
12 years 8 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
BMCBI
2007
128views more  BMCBI 2007»
13 years 5 months ago
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assess
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...
Paolo Ferragina, Raffaele Giancarlo, Valentina Gre...