Sciweavers

2600 search results - page 51 / 520
» Clustering with or without the Approximation
Sort
View
ICS
2004
Tsinghua U.
15 years 3 months ago
Cluster prefetch: tolerating on-chip wire delays in clustered microarchitectures
The growing dominance of wire delays at future technology points renders a microprocessor communication-bound. Clustered microarchitectures allow most dependence chains to execute...
Rajeev Balasubramonian
ICMCS
2005
IEEE
132views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Approximating the selectivity of multimedia range queries
This paper introduces a new approach of approximating the selectivity of multimedia range queries. Estimating the selectivity of a range query is a pre-requisite to optimize a mul...
Mario Döller, Harald Kosch
AMC
2011
14 years 4 months ago
Approximate inverse-free preconditioners for Toeplitz matrices
In this paper, we propose approximate inverse-free preconditioners for solving Toeplitz systems. The preconditioners are constructed based on the famous Gohberg-Sememcul formula. ...
You-Wei Wen, Wai-Ki Ching, Michael Ng
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
15 years 10 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
COMPGEOM
2006
ACM
15 years 3 months ago
Embedding ultrametrics into low-dimensional spaces
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...