Sciweavers

29 search results - page 4 / 6
» A generalised upper bound for the k-tuple domination number
Sort
View
FOCS
2008
IEEE
14 years 1 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx
ECRTS
2002
IEEE
14 years 9 days ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat
GLOBECOM
2008
IEEE
14 years 1 months ago
Performance Analysis of Free-Space Optical Systems in Gamma-Gamma Fading
— Atmospheric turbulence induced fading is one of the main impairments affecting free–space optics (FSO). In recent years, Gamma–Gamma fading has become the dominant fading m...
Ehsan Bayaki, Robert Schober, Ranjan K. Mallik
MOBICOM
2006
ACM
14 years 1 months ago
Broadcast capacity in multihop wireless networks
In this paper we study the broadcast capacity of multihop wireless networks which we define as the maximum rate at which broadcast packets can be generated in the network such th...
Alireza Keshavarz-Haddad, Vinay J. Ribeiro, Rudolf...
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh