Sciweavers

93 search results - page 11 / 19
» Making k-means Even Faster
Sort
View
KDD
2007
ACM
179views Data Mining» more  KDD 2007»
14 years 2 months ago
Mining statistically important equivalence classes and delta-discriminative emerging patterns
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
Jinyan Li, Guimei Liu, Limsoon Wong
IPPS
2006
IEEE
14 years 2 months ago
GPU-ABiSort: optimal parallel sorting on stream architectures
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
Alexander Greß, Gabriel Zachmann
PR
2008
141views more  PR 2008»
13 years 8 months ago
Robust and efficient multiclass SVM models for phrase pattern recognition
Phrase pattern recognition (phrase chunking) refers to automatic approaches for identifying predefined phrase structures in a stream of text. Support vector machines (SVMs)-based ...
Yu-Chieh Wu, Yue-Shi Lee, Jie-Chi Yang
PVLDB
2008
110views more  PVLDB 2008»
13 years 8 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons
IPPS
2005
IEEE
14 years 2 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick