Sciweavers

3656 search results - page 189 / 732
» Compact Location Problems
Sort
View
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
16 years 3 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
MHCI
2004
Springer
15 years 11 months ago
Supporting Mobile Applications with Real-Time Visualisation of GPS Availability
Many mobile applications rely on the Global Positioning System (GPS) to provide position and location information. However, there are many problems with using GPS in urban environm...
Anthony Steed
FC
1999
Springer
97views Cryptology» more  FC 1999»
15 years 10 months ago
Playing "Hide and Seek" with Stored Keys
In this paper we consider the problem of efficiently locating cryptographic keys hidden in gigabytes of data, such as the complete file system of a typical PC. We describe efficie...
Adi Shamir, Nicko van Someren
152
Voted
FLAIRS
2003
15 years 7 months ago
Indeterminacy and Rough Approximation
This paper deals with the problem of merging descriptions of approximate spatial location specified at different levels of granularity. We distinguish between the roughness of an...
Thomas Bittner
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 6 months ago
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
Timothy M. Chan, Mihai Patrascu