Sciweavers

807 search results - page 124 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
IVS
2008
121views more  IVS 2008»
13 years 8 months ago
Using treemaps for variable selection in spatio-temporal visualisation
We demonstrate and reflect upon the use of enhanced treemaps that incorporate spatial and temporal ordering for exploring a large multivariate spatio-temporal data set. The result...
Aidan Slingsby, Jason Dykes, Jo Wood
IVC
2006
227views more  IVC 2006»
13 years 8 months ago
Automatic registration of overlapping 3D point clouds using closest points
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
Yonghuai Liu
DGCI
2005
Springer
14 years 2 months ago
Arbitrary 3D Resolution Discrete Ray Tracing of Implicit Surfaces
A new approach to ray tracing implicit surfaces based on recursive space subdivision is presented in this paper. Interval arithmetic, already used to calculate intersections in ray...
Nilo Stolte
IDEAS
2002
IEEE
113views Database» more  IDEAS 2002»
14 years 1 months ago
Scalable QoS-Aware Disk-Scheduling
A new quality of service (QoS) aware disk scheduling algorithm is presented. It is applicable in environments where data requests arrive with different QoS requirements such as re...
Walid G. Aref, Khaled El-Bassyouni, Ibrahim Kamel,...
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 3 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits