Sciweavers

140 search results - page 12 / 28
» Eliminating Dependent Pattern Matching
Sort
View
BMCBI
2008
129views more  BMCBI 2008»
14 years 10 months ago
Triad pattern algorithm for predicting strong promoter candidates in bacterial genomes
Background: Bacterial promoters, which increase the efficiency of gene expression, differ from other promoters by several characteristics. This difference, not yet widely exploite...
Michael Dekhtyar, Amelie Morin, Vehary Sakanyan
IISWC
2008
IEEE
15 years 4 months ago
A workload for evaluating deep packet inspection architectures
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
Michela Becchi, Mark A. Franklin, Patrick Crowley
FQAS
2004
Springer
146views Database» more  FQAS 2004»
15 years 1 months ago
Discovering Representative Models in Large Time Series Databases
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
Simona E. Rombo, Giorgio Terracina
PADL
2010
Springer
15 years 6 months ago
Conversion by Evaluation
Abstract. We show how testing convertibility of two types in dependently typed systems can advantageously be implemented instead untyped normalization by evaluation, thereby reusin...
Mathieu Boespflug
TYPES
2004
Springer
15 years 3 months ago
A Few Constructions on Constructors
We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constru...
Conor McBride, Healfdene Goguen, James McKinna