Sciweavers

95 search results - page 4 / 19
» Fast, Flexible Syntactic Pattern Matching and Processing
Sort
View
ICFP
2004
ACM
15 years 9 months ago
Regular expression patterns
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
Niklas Broberg, Andreas Farre, Josef Svenningsson
CASES
2001
ACM
15 years 1 months ago
Application specific architectures: a recipe for fast, flexible and power efficient designs
The general purpose processor has long been the focus of intense optimization efforts that have resulted in an impressive doubling of performance every 18 months. However, recent ...
Christopher T. Weaver, Rajeev Krishna, Lisa Wu, To...
WWW
2005
ACM
15 years 10 months ago
An adaptive, fast, and safe XML parser based on byte sequences memorization
XML (Extensible Markup Language) processing can incur significant runtime overhead in XML-based infrastructural middleware such as Web service application servers. This paper prop...
Toshiro Takase, Hisashi Miyashita, Toyotaro Suzumu...
BMCBI
2008
103views more  BMCBI 2008»
14 years 9 months ago
TOPS++FATCAT: Fast flexible structural alignment using constraints derived from TOPS+ Strings Model
Background: Protein structure analysis and comparison are major challenges in structural bioinformatics. Despite the existence of many tools and algorithms, very few of them have ...
Mallika Veeramalai, Yuzhen Ye, Adam Godzik
FPL
2003
Springer
164views Hardware» more  FPL 2003»
15 years 2 months ago
Fast, Large-Scale String Match for a 10Gbps FPGA-Based Network Intrusion Detection System
Intrusion Detection Systems such as Snort scan incoming packets for evidence of security threats. The most computation-intensive part of these systems is a text search against hund...
Ioannis Sourdis, Dionisios N. Pnevmatikatos