Sciweavers

2600 search results - page 14 / 520
» Clustering with or without the Approximation
Sort
View
HPDC
2007
IEEE
14 years 2 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura
EMNLP
2010
13 years 5 months ago
NLP on Spoken Documents Without ASR
There is considerable interest in interdisciplinary combinations of automatic speech recognition (ASR), machine learning, natural language processing, text classification and info...
Mark Dredze, Aren Jansen, Glen Coppersmith, Ken Wa...
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
13 years 9 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
CLA
2006
13 years 9 months ago
Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data
The paper presents additional results on factorization by similarity of fuzzy concept lattices. A fuzzy concept lattice is a hierarchically ordered collection of clusters extracted...
Radim Belohlávek, Jan Outrata, Vilém...
ALT
2006
Springer
14 years 4 months ago
Teaching Memoryless Randomized Learners Without Feedback
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
Frank J. Balbach, Thomas Zeugmann