Sciweavers

4541 search results - page 276 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
CORR
2012
Springer
281views Education» more  CORR 2012»
13 years 11 months ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong
IDEAS
2000
IEEE
112views Database» more  IDEAS 2000»
15 years 8 months ago
Bulk Loading a Data Warehouse Built Upon a UB-Tree
This paper considers the issue of bulk loading large data sets for the UB-Tree, a multidimensional index structure. Especially in dataware housing (DW), data mining and OLAP it is...
Robert Fenk, Akihiko Kawakami, Volker Markl, Rudol...
122
Voted
ICIP
2009
IEEE
16 years 4 months ago
Sparsity And Morphological Diversity For Hyperspectral Data Analysis
Recently morphological diversity and sparsity have emerged as new and effective sources of diversity for Blind Source Separation. Based on these new concepts, novel methods such a...
130
Voted
FSKD
2006
Springer
199views Fuzzy Logic» more  FSKD 2006»
15 years 7 months ago
Location-Aware Data Mining for Mobile Users Based on Neuro-fuzzy System
Data mining tools generally deal with highly structured and precise data. However, classical methods fail to handle imprecise or uncertain information. This paper proposes a neuro-...
Romeo Mark A. Mateo, Malrey Lee, Su-Chong Joo, Jae...
143
Voted
CATA
2004
15 years 5 months ago
Decision Tree Induction for Dynamic, High-Dimensional Data Using P-Trees
1 Decision Tree Induction is a powerful classification tool that is much used in practice and works well for static data with dozens of attributes. We adapt the decision tree conce...
Anne Denton, William Perrizo