Sciweavers

502 search results - page 4 / 101
» Verifying Balanced Trees
Sort
View
MSV
2004
13 years 10 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko

Publication
198views
12 years 5 months ago
A Blink Tree latch method and protocol to support synchronous node deletion
A new Blink Tree latching method and protocol simplifies implementation of Lehman and Yao's high concurrency Blink Tree with Jaluta's balanced Blink Tree methods with in...
Karl Malbrain
ICPPW
1999
IEEE
14 years 25 days ago
Performance Evaluation of Public-Key Certificate Revocation System with Balanced Hash Tree
A new method for updating certificate revocation trees (CRT) is proposed. Efficient revocation of publickey certificates is a current issue in public-key Infrastructure because a ...
Hiroaki Kikuchi, Kensuke Abe, Shohachiro Nakanishi
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 2 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
CHI
2009
ACM
14 years 9 months ago
Predicting shoppers' interest from social interactions using sociometric sensors
Marketing research has longed for better ways to measure consumer behavior. In this paper, we explore using sociometric data to study social behaviors of group shoppers. We hypoth...
James Begole, Maurice Chu, Oliver Brdiczka, Taemie...