Sciweavers

3656 search results - page 24 / 732
» Compact Location Problems
Sort
View
VLDB
1994
ACM
101views Database» more  VLDB 1994»
14 years 1 months ago
New Concurrency Control Algorithms for Accessing and Compacting B-Trees
This paper initially presents a brief but fairly exhaustive survey of solutions to the concurrency control problem for B-trees. We then propose a new solution, which is characteri...
V. W. Setzer, Andrea Zisman
TEC
2008
115views more  TEC 2008»
13 years 9 months ago
Function Approximation With XCS: Hyperellipsoidal Conditions, Recursive Least Squares, and Compaction
An important strength of learning classifier systems (LCSs) lies in the combination of genetic optimization techniques with gradient-based approximation techniques. The chosen app...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
CORR
2008
Springer
60views Education» more  CORR 2008»
13 years 10 months ago
Stability of Curvature Measures
We address the problem of curvature estimation from sampled compact sets. The main contribution is a stability result: we show that the Gaussian, mean or anisotropic curvature mea...
Frédéric Chazal, David Cohen-Steiner...
WMASH
2004
ACM
14 years 3 months ago
LOCATOR: location estimation system For wireless LANs
With the wide spread growth of mobile computing devices and local area wireless networks, wireless network providers have started to target the users with value-added services bas...
Ankur Agiwal, Parakram Khandpur, Huzur Saran
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
13 years 9 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...