Sciweavers

ICTCS
2005
Springer
13 years 10 months ago
Faster Deterministic Wakeup in Multiple Access Channels
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...
Gianluca De Marco, Marco Pellegrini, Giovanni Sbur...
ICTCS
2005
Springer
13 years 10 months ago
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
Tsvi Kopelowitz, Ely Porat
ICTCS
2005
Springer
13 years 10 months ago
A Typed Assembly Language for Non-interference
Abstract. Non-interference is a desirable property of systems in a multilevel security architecture, stating that confidential information is not disclosed in public output. The c...
Ricardo Medel, Adriana B. Compagnoni, Eduardo Bone...
ICTCS
2005
Springer
13 years 10 months ago
Laxity Helps in Broadcast Scheduling
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keun...
ICTCS
2005
Springer
13 years 10 months ago
Quantum Algorithms for a Set of Group Theoretic Problems
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
Stephen A. Fenner, Yong Zhang
ICTCS
2005
Springer
13 years 10 months ago
Weighted Coloring: Further Complexity and Approximability Results
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
Bruno Escoffier, Jérôme Monnot, Vange...
ICTCS
2005
Springer
13 years 10 months ago
Inapproximability Results for the Lateral Gene Transfer Problem
This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene trans...
Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakr...
ICTCS
2005
Springer
13 years 10 months ago
Error Mining for Regular Expression Patterns
In the design of type systems for XML programming languages based on regular expression types and patterns the focus has been over result analysis, with the main aim of statically ...
Giuseppe Castagna, Dario Colazzo, Alain Frisch