CORR
2006
Springer
13 years 11 months ago
2006
Springer
CORR
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
FLAIM (Framework for Log Anonymization and Information Management) addresses two important needs not well addressed by current log anonymizers. First, it is extremely modular and ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we investigate the efficiency of various strategies for subdividing polynomial triangular surface patches. We give a simple algorithm performing a regular subdivisio...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract-- We investigate cascade dynamics in thresholdcontrolled (multiplex) propagation on random geometric networks. We find that such local dynamics can serve as an efficient, ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...