86 search results - page 2 / 18 » Worst Case Optimal Union-Intersection Expression Evaluation |
RTAS
2005
IEEE
13 years 11 months ago
2005
IEEE
It is advantageous to perform compiler optimizations to lower the WCET of a task since tasks with lower WCETs are easier to schedule and more likely to meet their deadlines. Compi...
MOBIHOC
2003
ACM
14 years 4 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
ISM
2006
IEEE
13 years 11 months ago
2006
IEEE
Currently, most quantization based data hiding algorithms are built assuming specific distributions of attacks, such as additive white Gaussian noise (AWGN), uniform noise, and s...
VLDB
2004
ACM
14 years 5 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
NJC
2006
13 years 5 months ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...