Sciweavers

1227 search results - page 116 / 246
» Approximate Kernel Clustering
Sort
View
EOR
2010
99views more  EOR 2010»
14 years 10 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or
PDPTA
2000
14 years 11 months ago
The PODOS File System - Exploiting the High-Speed Communication Subsystem
Performance Oriented Distributed Operating System (PODOS) is a clustering environment, being built on a monolithic Linux kernel. PODOS augments very few components to the Linux ke...
Sudharshan Vazhkudai, P. Tobin Maginnis
CIKM
2000
Springer
15 years 2 months ago
Vector Approximation based Indexing for Non-uniform High Dimensional Data Sets
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based techniqu...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
CIKM
2010
Springer
14 years 8 months ago
Hypergraph-based multilevel matrix approximation for text information retrieval
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
Haw-ren Fang, Yousef Saad
ICALP
2005
Springer
15 years 3 months ago
Linear Time Algorithms for Clustering Problems in Any Dimensions
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
Amit Kumar, Yogish Sabharwal, Sandeep Sen