Sciweavers

8825 search results - page 196 / 1765
» All for one or one for all
Sort
View
PODS
2005
ACM
118views Database» more  PODS 2005»
16 years 1 months ago
On the complexity of division and set joins in the relational algebra
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
Dirk Leinders, Jan Van den Bussche
86
Voted
PERCOM
2006
ACM
16 years 1 months ago
Introducing History-Enriched Security Context Transfer to Enhance the Security of Subsequent Handover
Many solutions for securing inter-provider handover proposed to date make use of the concept of security context transfer. However, none of these solutions addresses problems aris...
Ulrike Meyer, Susanne Wetzel
MSWIM
2009
ACM
15 years 8 months ago
Delay-throughput performance in mobile ad-hoc networks with heterogeneous nodes
In this paper, we analyze asymptotic delay-throughput performance of mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility. In particular, we consider a s...
Valentina Martina, Michele Garetto, Emilio Leonard...
LATA
2009
Springer
15 years 8 months ago
On a Family of Morphic Images of Arnoux-Rauzy Words
Abstract. In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N ≥ 0 be an integer. Suppose that all left special factors of s longe...
Michelangelo Bucci, Alessandro De Luca
FAW
2009
Springer
180views Algorithms» more  FAW 2009»
15 years 8 months ago
Edge Search Number of Cographs in Linear Time
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...
Pinar Heggernes, Rodica Mihai