Sciweavers

4542 search results - page 626 / 909
» Design patterns for data structures
Sort
View
ICS
2005
Tsinghua U.
16 years 3 days ago
Lightweight reference affinity analysis
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
Xipeng Shen, Yaoqing Gao, Chen Ding, Roch Archamba...
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
16 years 19 days ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
SADM
2010
196views more  SADM 2010»
15 years 1 months ago
Bayesian adaptive nearest neighbor
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Ruixin Guo, Sounak Chakraborty
DOLAP
2000
ACM
15 years 11 months ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
Lixin Fu, Joachim Hammer
192
Voted
DOLAP
2008
ACM
15 years 8 months ago
Solving summarizability problems in fact-dimension relationships for multidimensional models
Multidimensional analysis allows decision makers to efficiently and effectively use data analysis tools, which mainly depend on multidimensional (MD) structures of a data warehous...
Jose-Norberto Mazón, Jens Lechtenbörge...