Sciweavers

36 search results - page 7 / 8
» Experiments on String Matching in Memory Structures
Sort
View
74
Voted
CCS
2009
ACM
15 years 4 months ago
Robust signatures for kernel data structures
Kernel-mode rootkits hide objects such as processes and threads using a technique known as Direct Kernel Object Manipulation (DKOM). Many forensic analysis tools attempt to detect...
Brendan Dolan-Gavitt, Abhinav Srivastava, Patrick ...
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 3 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
JCDL
2003
ACM
101views Education» more  JCDL 2003»
15 years 2 months ago
Bibliographic Attribute Extraction from Erroneous References Based on a Statistical Model
In this paper, we propose a method for extracting bibliographic attributes from reference strings captured using Optical Character Recognition (OCR) and an extended hidden Markov ...
Atsuhiro Takasu
SSDBM
2003
IEEE
141views Database» more  SSDBM 2003»
15 years 2 months ago
The ed-tree: An Index for Large DNA Sequence Databases
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...
Zhenqiang Tan, Xia Cao, Beng Chin Ooi, Anthony K. ...
114
Voted
BC
2002
193views more  BC 2002»
14 years 9 months ago
Resonant spatiotemporal learning in large random recurrent networks
Taking a global analogy with the structure of perceptual biological systems, we present a system composed of two layers of real-valued sigmoidal neurons. The primary layer receives...
Emmanuel Daucé, Mathias Quoy, Bernard Doyon