Sciweavers

1977 search results - page 330 / 396
» The satisfactory partition problem
Sort
View
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
14 years 2 months ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
Boriana L. Milenova, Marcos M. Campos
IEEEPACT
2002
IEEE
14 years 2 months ago
An Evaluation of Data-Parallel Compiler Support for Line-Sweep Applications
Data parallel compilers have long aimed to equal the performance of carefully hand-optimized parallel codes. For tightly-coupled applications based on line sweeps, this goal has b...
Daniel G. Chavarría-Miranda, John M. Mellor...
ITS
2010
Springer
152views Multimedia» more  ITS 2010»
14 years 2 months ago
A Network Analysis of Student Groups in Threaded Discussions
As online discussion boards become a popular medium for collaborative problem solving, we would like to understand patterns of group interactions that lead to collaborative learnin...
Jeon-Hyung Kang, Jihie Kim, Erin Shaw
CIKM
2009
Springer
14 years 2 months ago
A novel approach for privacy mining of generic basic association rules
Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties...
Moez Waddey, Pascal Poncelet, Sadok Ben Yahia
WIA
2009
Springer
14 years 2 months ago
On Extremal Cases of Hopcroft's Algorithm
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
Giusi Castiglione, Antonio Restivo, Marinella Scio...