Join Our Newsletter

RV

2010

Springer

11 years 3 months ago
2010

Springer

This tutorial deals with runtime enforcement which is an extension of runtime veriﬁcation aiming to circumvent misbehaviors of systems. After an historical overview of previous a...

NAR

2007

11 years 5 months ago
2007

FLAN (short for FLu ANnotation), the NCBI web server for genome annotation of influenza virus (http://www.ncbi.nlm.nih.gov/genomes/FLU/ Database/annotation.cgi) is a tool for user...

COMBINATORICS

1998

11 years 5 months ago
1998

Let α and β be a partition of {1, . . . , n} into two blocks. A merging network is a network of comparators which allows as input arbitrary real numbers and has the property tha...

DAC

1997

ACM

11 years 9 months ago
1997

ACM

- The objective of this paper is to provide an effective technique for accurate modeling of the external input sequences that affect the behavior of Finite State Machines (FSMs). T...

SPIRE

2005

Springer

11 years 11 months ago
2005

Springer

We consider the problem of ﬁnding pairs of short patterns such that, in a given input sequence of length n, the distance between each pair’s patterns is at least α. The proble...

ICDM

2006

IEEE

11 years 11 months ago
2006

IEEE

The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efﬁcient approaches are propose...

TAMC

2007

Springer

11 years 11 months ago
2007

Springer

We consider the following problem in a stream model: Given a sequence a = a1, a2, . . . , am wich each ai ∈ [n] = {1, . . . , n} and m > n, ﬁnd a duplicate in the sequence, ...

CPM

2007

Springer

11 years 11 months ago
2007

Springer

Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...

FOCS

2008

IEEE

11 years 12 months ago
2008

IEEE

In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...

ISCIS

2009

Springer

12 years 2 days ago
2009

Springer

—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...