Sciweavers

1068 search results - page 117 / 214
» On Space Bounded Server Algorithms
Sort
View
CCS
2008
ACM
13 years 10 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
FOCS
1994
IEEE
14 years 6 hour ago
On-line Admission Control and Circuit Routing for High Performance Computing and Communication
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
Baruch Awerbuch, Rainer Gawlick, Frank Thomson Lei...
FGR
2000
IEEE
162views Biometrics» more  FGR 2000»
13 years 11 months ago
Person Tracking in Real-World Scenarios Using Statistical Methods
This paper presents a novel approach to robust and flexible person tracking using an algorithm that combines two powerful stochastic modeling techniques: The first one is the tech...
Gerhard Rigoll, Stefan Eickeler, Stefan Mülle...
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 8 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
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 8 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount