Sciweavers

535 search results - page 89 / 107
» Insertion and Expansion Operations for
Sort
View
PASTE
2010
ACM
13 years 8 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
USS
2004
13 years 8 months ago
TIED, LibsafePlus: Tools for Runtime Buffer Overflow Protection
Buffer overflow exploits make use of the treatment of strings in C as character arrays rather than as first-class objects. Manipulation of arrays as pointers and primitive pointer...
Kumar Avijit, Prateek Gupta, Deepak Gupta
EACL
1993
ACL Anthology
13 years 8 months ago
Tuples, Discontinuity, and Gapping in Categorial Grammar
This paper solves some puzzles in the formalisation of logic for discontinuity in categorial grammar. A ‘tuple’ operation introduced in [Solias, 1992] is defined as a mode of...
Glyn Morrill, Teresa Solias
SIGCOMM
2012
ACM
11 years 9 months ago
HyperDex: a distributed, searchable key-value store
Distributed key-value stores are now a standard component of high-performance web services and cloud computing applications. While key-value stores offer significant performance...
Robert Escriva, Bernard Wong, Emin Gün Sirer
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...