2089 search results - page 189 / 418 » A New Problem in String Searching |
BIRTHDAY
1994
Springer
15 years 2 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
78
Voted
CCS
2008
ACM
15 years 1 days ago
2008
ACM
Current taint tracking systems suffer from high overhead and a lack of generality. In this paper, we solve both of these issues with an extensible system that is an order of magni...
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
In a variety of applications, kernel machines such as Support Vector Machines (SVMs) have been used with great success often delivering stateof-the-art results. Using the kernel t...
84
Voted
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
103
Voted
ALGORITHMICA
2011
14 years 5 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...