Sciweavers

804 search results - page 7 / 161
» Experiments on Union-Find Algorithms for the Disjoint-Set Da...
Sort
View
IJON
2011
186views more  IJON 2011»
12 years 11 months ago
Discriminative structure selection method of Gaussian Mixture Models with its application to handwritten digit recognition
, Yunde Jia Model structure selection is currently an open problem in modeling data via Gaussian Mixture Models (GMM). This paper proposes a discriminative method to select GMM st...
Xuefeng Chen, Xiabi Liu, Yunde Jia
FGCS
2006
125views more  FGCS 2006»
13 years 7 months ago
Compressible memory data structures for event-based trace analysis
The article presents a new compressible memory data structure for trace events. Its primary intention is to aid the analysis of huge traces by reducing the memory requirements sig...
Andreas Knüpfer, Wolfgang E. Nagel
ICDE
1999
IEEE
91views Database» more  ICDE 1999»
14 years 9 months ago
Real-Time Data Access Control on B-Tree Index Structures
This paper proposes methodologies to control the access of B-tree-indexed data in a batch and real-time fashion. Algorithms are proposed to insert, query, delete, and rebalance B-...
Tei-Wei Kuo, Chih-Hung Wei, Kam-yiu Lam
SCM
2003
13 years 9 months ago
Merging Collection Data Structures in a Content Management System
Abstract. Motivated by our work on object-oriented Content Management, this paper proposes an extensible formal framework for delta and merging strategies, each applicable to a spe...
Axel Wienberg
IDEAL
2003
Springer
14 years 25 days ago
Experiences of Using a Quantitative Approach for Mining Association Rules
In recent years interest has grown in “mining” large databases to extract novel and interesting information. Knowledge Discovery in Databases (KDD) has been recognised as an em...
L. Dong, Christos Tjortjis