Sciweavers

4536 search results - page 630 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
I3D
2010
ACM
16 years 4 months ago
Efficient Sparse Voxel Octrees
In this paper we examine the possibilities of using voxel representations as a generic way for expressing complex and feature-rich geometry on current and future GPUs. We present ...
Samuli Laine, Tero Karras
EDBT
2009
ACM
124views Database» more  EDBT 2009»
16 years 1 months ago
A sequential indexing scheme for flash-based embedded systems
NAND Flash has become the most popular stable storage medium for embedded systems. As on-board storage capacity increases, the need for efficient indexing techniques arises. Such ...
Shaoyi Yin, Philippe Pucheral, Xiaofeng Meng
ICPR
2008
IEEE
16 years 1 months ago
Parameter-based reduction of Gaussian mixture models with a variational-Bayes approach
This paper 1 proposes a technique for simplifying a given Gaussian mixture model, i.e. reformulating the density in a more parcimonious manner, if possible (less Gaussian componen...
Pierrick Bruneau, Marc Gelgon, Fabien Picarougne
161
Voted
ICANN
2007
Springer
16 years 25 days ago
Unbiased SVM Density Estimation with Application to Graphical Pattern Recognition
Abstract. Classification of structured data (i.e., data that are represented as graphs) is a topic of interest in the machine learning community. This paper presents a different,...
Edmondo Trentin, Ernesto Di Iorio
LFCS
2007
Springer
16 years 24 days ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang