Sciweavers

2165 search results - page 128 / 433
» cases 2005
Sort
View
PPAM
2005
Springer
15 years 9 months ago
A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...
Pavel Tvrdík, Ivan Simecek
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
15 years 9 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
AIR
2005
114views more  AIR 2005»
15 years 3 months ago
Airport Gate Scheduling with Time Windows
In contrast to the existing airport gate assignment studies where flight have fixed schedules, we consider the more realistic situation where flight arrival and departure times can...
Andrew Lim, Brian Rodrigues, Yi Zhu
IPMI
2005
Springer
16 years 4 months ago
Design of Robust Vascular Tree Matching: Validation on Liver
Abstract. In this paper, we propose an original and efficient tree matching algorithm for intra-patient hepatic vascular system registration. Vascular systems are segmented from CT...
Arnaud Charnoz, Vincent Agnus, Grégoire Mal...
SOFSEM
2007
Springer
15 years 10 months ago
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
Yefim Dinitz, Shay Solomon