3735 search results - page 41 / 747 » Order compression schemes |
DCC
2008
IEEE
16 years 1 days ago
2008
IEEE
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
114
click to vote
CPM
1999
Springer
15 years 4 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
121
click to vote
CORR
2010
Springer
15 years 16 days ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
128
Voted
SACRYPT
2005
Springer
15 years 6 months ago
2005
Springer
In a hierarchical structure, an entity has access to another if and only if the former is a superior of the later. The access control scheme for a hierarchy represented by a partia...
CHES
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In the recent years, DPA attacks have been widely investigated. In particular, 2-nd order DPA have been improved and successfully applied to break many masked implementat...