Sciweavers

10 search results - page 2 / 2
» acta 2006
Sort
View
93
Voted
ACTA
2006
74views more  ACTA 2006»
14 years 10 months ago
Linearly bounded infinite graphs
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
Arnaud Carayol, Antoine Meyer
ACTA
2006
108views more  ACTA 2006»
14 years 10 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
ACTA
2006
70views more  ACTA 2006»
14 years 10 months ago
Throughput analysis in wireless networks with multiple users and multiple channels
Abstract We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incur...
Amrinder Arora, Fanchun Jin, Gokhan Sahin, Hosam M...
ACTA
2006
104views more  ACTA 2006»
14 years 10 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti
SAC
2006
ACM
15 years 4 months ago
KALA: Kernel Aspect language for advanced transactions
Transaction management is a known crosscutting concern. Previous research has been conducted to express this concern as an aspect. However, such work has used general-purpose aspe...
Johan Fabry, Theo D'Hondt