Sciweavers

2089 search results - page 34 / 418
» A New Problem in String Searching
Sort
View
SIAMCOMP
1998
113views more  SIAMCOMP 1998»
14 years 9 months ago
Two-Dimensional Periodicity in Rectangular Arrays
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
Amihood Amir, Gary Benson
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
15 years 10 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
TOC
2010
155views Management» more  TOC 2010»
14 years 4 months ago
A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
Andris Ambainis
ICNP
2006
IEEE
15 years 3 months ago
High Speed Pattern Matching for Network IDS/IPS
— The phenomenal growth of the Internet in the last decade and society’s increasing dependence on it has brought along, a flood of security attacks on the networking and compu...
Mansoor Alicherry, Muthusrinivasan Muthuprasanna, ...
AIPS
2004
14 years 11 months ago
Conformant Planning via Heuristic Forward Search: A New Approach
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The p...
Ronen I. Brafman, Jörg Hoffmann