Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
RV
2010
Springer
127views Hardware» more  RV 2010»
11 years 3 months ago
You Should Better Enforce Than Verify
This tutorial deals with runtime enforcement which is an extension of runtime verification aiming to circumvent misbehaviors of systems. After an historical overview of previous a...
Yliès Falcone
NAR
2007
145views more  NAR 2007»
11 years 5 months ago
FLAN: a web server for influenza virus genome annotation
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...
Yiming Bao, Pavel Bolotov, Dmitry Dernovoy, Boris ...
COMBINATORICS
1998
80views more  COMBINATORICS 1998»
11 years 5 months ago
Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks
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...
Edward A. Bender, S. Gill Williamson
DAC
1997
ACM
11 years 9 months ago
Sequence Compaction for Probabilistic Analysis of Finite-State Machines
- 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...
Diana Marculescu, Radu Marculescu, Massoud Pedram
SPIRE
2005
Springer
11 years 11 months ago
Composite Pattern Discovery for PCR Application
We consider the problem of finding 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...
Stanislav Angelov, Shunsuke Inenaga
ICDM
2006
IEEE
135views Data Mining» more  ICDM 2006»
11 years 11 months ago
Discovering Frequent Poly-Regions in DNA Sequences
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 efficient approaches are propose...
Panagiotis Papapetrou, Gary Benson, George Kollios
TAMC
2007
Springer
11 years 11 months ago
Finding a Duplicate and a Missing Item in a Stream
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, find a duplicate in the sequence, ...
Jun Tarui
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
11 years 11 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield
FOCS
2008
IEEE
11 years 12 months ago
The Power of Reordering for Online Minimum Makespan Scheduling
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...
Matthias Englert, Deniz Özmen, Matthias Weste...
ISCIS
2009
Springer
12 years 2 days ago
Using a SAT solver to generate checking sequences
—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...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
books