934 search results - page 168 / 187 » A theoretical analysis of the HIFF problem |
161
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
77
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
77
Voted
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...