Sciweavers

669 search results - page 71 / 134
» Decision-theoretic Clustering of Strategies
Sort
View
128
Voted
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 5 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
81
Voted
AUSAI
2007
Springer
15 years 6 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
ICDE
2003
IEEE
180views Database» more  ICDE 2003»
16 years 2 months ago
Medical Video Mining for Efficient Database Indexing, Management and Access
1 To achieve more efficient video indexing and access, we introduce a video database management framework and strategies for video content structure and events mining. The video sh...
Xingquan Zhu, Walid G. Aref, Jianping Fan, Ann Chr...
CCGRID
2006
IEEE
15 years 6 months ago
Statistical Data Reduction for Efficient Application Performance Monitoring
There is a growing need for systems that can monitor and analyze application performance data automatically in order to deliver reliable and sustained performance to applications....
Lingyun Yang, Jennifer M. Schopf, Catalin Dumitres...
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
15 years 6 months ago
Better Spread and Convergence: Particle Swarm Multiobjective Optimization Using the Maximin Fitness Function
Maximin strategy has its origin in game theory, but it can be adopted for effective multiobjective optimization. This paper proposes a particle swarm multiobjective optimiser, max...
Xiaodong Li