Sciweavers

2681 search results - page 347 / 537
» Problem F
Sort
View
SPAA
2003
ACM
15 years 11 months ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders
KDD
2010
ACM
195views Data Mining» more  KDD 2010»
15 years 10 months ago
Universal multi-dimensional scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 10 months ago
A computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies
First, the covariance matrix adaptation (CMA) with rankone update is introduced into the (1+1)-evolution strategy. An improved implementation of the 1/5-th success rule is propose...
Christian Igel, Thorsten Suttorp, Nikolaus Hansen
CIKM
2010
Springer
15 years 5 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
EDBT
2011
ACM
281views Database» more  EDBT 2011»
14 years 10 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo