Sciweavers

8431 search results - page 129 / 1687
» Algorithmically Independent Sequences
Sort
View
STOC
2003
ACM
78views Algorithms» more  STOC 2003»
15 years 10 months ago
Touring a sequence of polygons
Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. M...
IANDC
2006
77views more  IANDC 2006»
14 years 10 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
14 years 10 months ago
Shift Equivalence of P-finite Sequences
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
Manuel Kauers
BIOCOMP
2006
14 years 11 months ago
PAC: Progressive Alignment with Consensus Sequences
Computation of multiple sequence alignments is one of the major open problems in computational molecular biology. The purpose of this study was to provide a new method, PAC (Progre...
Ke Liu, Mansur H. Samadzadeh
ECMDAFA
2005
Springer
236views Hardware» more  ECMDAFA 2005»
15 years 3 months ago
Model-Driven Architecture for Hard Real-Time Systems: From Platform Independent Models to Code
The model-driven software development for hard real-time systems promotes the usage of the platform independent model as major design artifact. It is used to develop the software l...
Sven Burmester, Holger Giese, Wilhelm Schäfer