Sciweavers

ESTIMEDIA
2006
Springer
14 years 2 months ago
Use of a Bit-true Data Flow Analysis for Processor-Specific Source Code Optimization
Nowadays, key characteristics of a processor's instruction set are only exploited in high-level languages by using inline assembly or compiler intrinsics. Inserting intrinsic...
Heiko Falk, Jens Wagner, André Schaefer
FCCM
2004
IEEE
96views VLSI» more  FCCM 2004»
14 years 2 months ago
Pre-Decoded CAMs for Efficient and High-Speed NIDS Pattern Matching
In this paper we advocate the use of pre-decoding for CAM-based pattern matching. We implement an FPGA based sub-system for NIDS (Snort) pattern matching using a combination of te...
Ioannis Sourdis, Dionisios N. Pnevmatikatos
BIRTHDAY
2006
Springer
14 years 2 months ago
Eliminating Dependent Pattern Matching
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
Healfdene Goguen, Conor McBride, James McKinna
ASPDAC
2006
ACM
173views Hardware» more  ASPDAC 2006»
14 years 2 months ago
Image segmentation and pattern matching based FPGA/ASIC implementation architecture of real-time object tracking
A novel algorithm for object tracking in video pictures, based on image segmentation and pattern matching, as well as its FPGA/ASIC implementation architecture are presented. With ...
K. Yamaoka, Takashi Morimoto, Hidekazu Adachi, Tet...
AMAST
2006
Springer
14 years 2 months ago
Formal Islands
Abstract. Motivated by the proliferation and usefulness of Domain Specific Languages as well as the demand in enriching well established languages by high level capabilities like p...
Emilie Balland, Claude Kirchner, Pierre-Etienne Mo...
APPROX
2004
Springer
89views Algorithms» more  APPROX 2004»
14 years 2 months ago
The Sketching Complexity of Pattern Matching
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
FOCS
2009
IEEE
14 years 2 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
DLS
2007
138views Languages» more  DLS 2007»
14 years 2 months ago
OMeta: an object-oriented language for pattern matching
This paper introduces OMeta, a new object-oriented language for pattern matching. OMeta is based on a variant of Parsing Expression Grammars (PEGs) [5]--a recognitionbased foundat...
Alessandro Warth, Ian Piumarta
APLAS
2007
ACM
14 years 2 months ago
Translation Correctness for First-Order Object-Oriented Pattern Matching
Pattern matching makes ML programs more concise and readable, and these qualities are also sought in object-oriented settings. However, objects and classes come with open erarchie...
Burak Emir, Qin Ma 0002, Martin Odersky
PEPM
1994
ACM
14 years 2 months ago
Binding-Time Analysis for Standard ML
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
Lars Birkedal, Morten Welinder