Sciweavers

2962 search results - page 217 / 593
» Optimizing Spatial Data Structures For Static Data
Sort
View
DLOG
2000
15 years 7 months ago
Optimizing TBox and ABox Reasoning with Pseudo Models
This paper investigates optimization techniques and data structures exploiting the use of so-called pseudo models. These techniques are applied to speed-up TBox and ABox reasoning...
Volker Haarslev, Ralf Möller
ISVC
2007
Springer
16 years 15 days ago
Fast kd -Tree Construction for 3D-Rendering Algorithms Like Ray Tracing
Many computer graphics rendering algorithms and techniques use ray tracing for generation of natural and photo-realistic images. The efficiency of the ray tracing algorithms depend...
Sajid Hussain, Håkan Grahn
CVPR
2008
IEEE
16 years 8 months ago
Context-aware clustering
Most existing methods of semi-supervised clustering introduce supervision from outside, e.g., manually label some data samples or introduce constrains into clustering results. Thi...
Junsong Yuan, Ying Wu
SOFTVIS
2010
ACM
15 years 6 months ago
Heapviz: interactive heap visualization for program understanding and debugging
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
Edward Aftandilian, Sean Kelley, Connor Gramazio, ...
MM
2005
ACM
122views Multimedia» more  MM 2005»
15 years 12 months ago
Image clustering with tensor representation
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
Xiaofei He, Deng Cai, Haifeng Liu, Jiawei Han