Sciweavers

681 search results - page 108 / 137
» et 2006
Sort
View
CSR
2006
Springer
15 years 1 months ago
All Semi-local Longest Common Subsequences in Subquadratic Time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
Alexandre Tiskin
DATE
2006
IEEE
78views Hardware» more  DATE 2006»
15 years 1 months ago
A time-triggered ethernet (TTE) switch
This paper presents the design of a Time-Triggered Ethernet (TTE) Switch, which is one of the core units of the Time-Triggered Ethernet system. Time-triggered Ethernet is a commun...
Klaus Steinhammer, Petr Grillinger, Astrit Ademaj,...
ETRICS
2006
15 years 1 months ago
An Algebra for Enterprise Privacy Policies Closed Under Composition and Conjunction
To cope with the complex requirements imposed on the processing of privacy-sensitive data within enterprises, the use of automatic or semi-automatic tools is gradually becoming in...
Dominik Raub, Rainer Steinwandt
FMICS
2006
Springer
15 years 1 months ago
"To Store or Not To Store" Reloaded: Reclaiming Memory on Demand
Behrmann et al. posed the question whether "To Store or Not To Store" [1] states during reachability analysis, in order to counter the effects of the well-known state spa...
Moritz Hammer, Michael Weber
110
Voted
FOSSACS
2006
Springer
15 years 1 months ago
Register Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
Fernando Magno Quintão Pereira, Jens Palsbe...