Sciweavers

4536 search results - page 289 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ML
2010
ACM
210views Machine Learning» more  ML 2010»
15 years 5 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
ICDAR
2009
IEEE
15 years 4 months ago
Learning Bayesian Networks by Evolution for Classifier Combination
Combining classifier methods have shown their effectiveness in a number of applications. Nonetheless, using simultaneously multiple classifiers may result in some cases in a reduc...
Claudio De Stefano, Francesco Fontanella, Alessand...
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
14 years 9 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
236
Voted
CORR
2012
Springer
281views Education» more  CORR 2012»
14 years 2 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
172
Voted
IDEAS
2000
IEEE
112views Database» more  IDEAS 2000»
15 years 11 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...