Sciweavers

220 search results - page 30 / 44
» tcs 2008
Sort
View
TCS
2008
14 years 12 months ago
On the power of lookahead in on-line server routing problems
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci,...
TCS
2008
14 years 12 months ago
Turing machines and bimachines
We associate the iterated block product of a bimachine with a deterministic Turing machine. This allows us to introduce new algebraic notions to study the behavior of the Turing m...
John Rhodes, Pedro V. Silva
80
Voted
TCS
2008
14 years 12 months ago
Seminormal rings (following Thierry Coquand)
The Traverso-Swan theorem says that a reduced ring A is seminormal if and only if the natural homomorphism Pic A Pic A[X] is an isomorphism ([18, 17]). We give here all the detai...
Henri Lombardi, Claude Quitté
TCS
2008
14 years 12 months ago
Anisotropic diagrams: Labelle Shewchuk approach revisited
F. Labelle and J. Shewchuk [3] have proposed a discrete definition of anisotropic Voronoi diagrams. These diagrams are parametrized by a metric field. Under mild hypotheses on the...
Jean-Daniel Boissonnat, Camille Wormser, Mariette ...
TCS
2008
14 years 12 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq