Sciweavers

2498 search results - page 222 / 500
» Data Structures with Unpredictable Timing
Sort
View
3DPVT
2002
IEEE
109views Visualization» more  3DPVT 2002»
15 years 7 months ago
A Hierarchy of Cameras for 3D Photography
We investigate the relationship between camera design and 3D photography, by examining the influence of camera design on the estimation of the motion and structure of a scene fro...
Jan Neumann, Cornelia Fermüller, Yiannis Aloi...
VLDB
2005
ACM
397views Database» more  VLDB 2005»
16 years 2 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
IJHPCA
2008
88views more  IJHPCA 2008»
15 years 2 months ago
Extending Grid-Based Workflow Tools With Patterns/Operators
Many Grid applications involve combining computational and data access components into complex workflows. A distinction is generally made between mechanisms to compose components ...
Maria Cecilia Gomes, Omer F. Rana, José C. ...
114
Voted
IPL
2010
71views more  IPL 2010»
15 years 29 days ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
138
Voted
MSV
2004
15 years 3 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