Sciweavers

2354 search results - page 303 / 471
» A Common-Sense Theory of Time
Sort
View
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 6 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
16 years 6 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
STOC
2003
ACM
137views Algorithms» more  STOC 2003»
16 years 6 months ago
Near-optimal network design with selfish agents
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
Elliot Anshelevich, Anirban Dasgupta, Éva T...
STOC
2003
ACM
99views Algorithms» more  STOC 2003»
16 years 6 months ago
On the fractal behavior of TCP
We propose a natural, mathematically tractable model of TCP which captures both its additive-increase, multiplicative-decrease behavior and its feedback mechanism. Neither a fluid...
Anna C. Gilbert, Howard J. Karloff
SIGMOD
2004
ACM
111views Database» more  SIGMOD 2004»
16 years 6 months ago
Spatial, Temporal and Spatio-Temporal Databases - Hot Issues and Directions for PhD Research
Spatial and temporal database systems, both in theory and in practice, have developed dramatically over the past two decades to the point where usable commercial systems, underpin...
John F. Roddick, Max J. Egenhofer, Erik G. Hoel, D...