Sciweavers

4008 search results - page 99 / 802
» An expressive language of signatures
Sort
View
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 10 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
PLANX
2008
15 years 7 months ago
XML Stream Processing Using a Lazy Concurrent Language
Motivated by previous work on XML stream processing, we noticed that programmers need concurrency to save space, especially in a lazy language. User-controllable concurrency provi...
Shin-Cheng Mu, Ta-Chung Tsai, Keisuke Nakano
DATE
2008
IEEE
182views Hardware» more  DATE 2008»
16 years 23 days ago
An adaptable FPGA-based System for Regular Expression Matching
In many applications string pattern matching is one of the most intensive tasks in terms of computation time and memory accesses. Network Intrusion Detection Systems and DNA Seque...
Ivano Bonesana, Marco Paolieri, Marco D. Santambro...
AAAI
2008
15 years 8 months ago
An Expressive Auction Design for Online Display Advertising
We propose an expressive auction design that allows advertisers to specify the kinds of demographics and websites they wish to target within an advertising network. The design all...
Sébastien Lahaie, David C. Parkes, David M....
CORR
2010
Springer
132views Education» more  CORR 2010»
15 years 6 months ago
Small NFAs from Regular Expressions: Some Experimental Results
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
Hugo Gouveia, Nelma Moreira, Rogério Reis