Sciweavers

272 search results - page 44 / 55
» Lazy tree splitting
Sort
View
SDMW
2004
Springer
15 years 7 months ago
Using Secret Sharing for Searching in Encrypted Data
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
Richard Brinkman, Jeroen Doumen, Willem Jonker
ICRA
2002
IEEE
111views Robotics» more  ICRA 2002»
15 years 6 months ago
Feature-Based Multi-Hypothesis Localization and Tracking for Mobile Robots using Geometric Constraints
In this paper we present a new probabilistic feature-based approach to multi-hypothesis global localization and pose tracking. Hypotheses are generated using a constraintbased sea...
Kai Oliver Arras, José A. Castellanos, Rola...
FUN
2010
Springer
285views Algorithms» more  FUN 2010»
15 years 6 months ago
An Algorithmic Analysis of the Honey-Bee Game
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
Rudolf Fleischer, Gerhard J. Woeginger
IPPS
1998
IEEE
15 years 6 months ago
Improved Concurrency Control Techniques For Multi-Dimensional Index Structures
Multi-dimensional index structures such as R-trees enable fast searching in high-dimensional spaces. They differ from uni-dimensional structures in the following aspects: (1) inde...
Kothuri Venkata Ravi Kanth, David Serena, Ambuj K....
117
Voted
GLVLSI
2010
IEEE
154views VLSI» more  GLVLSI 2010»
15 years 3 months ago
Resource-constrained timing-driven link insertion for critical delay reduction
For timing-driven or yield-driven designs, non-tree routing has become more and more popular and additional loops provide the redundant paths to protect against the effect of the ...
Jin-Tai Yan, Zhi-Wei Chen