555 search results - page 111 / 111 » Between Symbol and Language-in-use |
INFOCOM
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
ASPLOS
2012
ACM
12 years 1 months ago
2012
ACM
Even though most data races are harmless, the harmful ones are at the heart of some of the worst concurrency bugs. Alas, spotting just the harmful data races in programs is like ...
BMCBI
2008
13 years 5 months ago
2008
Since the publication of our article (Roth, Gonnet, and Dessimoz: BMC Bioinformatics 2008 9: 518), we have noticed several errors, which we correct in the following. Correction We...
STOC
2006
ACM
14 years 6 months ago
2006
ACM
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
TALG
2008
13 years 5 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...