Sciweavers

7015 search results - page 397 / 1403
» Approximation algorithms for co-clustering
Sort
View
HPDC
2006
IEEE
16 years 26 days ago
Path Grammar Guided Trace Compression and Trace Approximation
Trace-driven simulation is an important technique used in the evaluation of computer architecture innovations. However using it for studying parallel computers and applications is...
Xiaofeng Gao, Allan Snavely, Larry Carter
203
Voted
OPODIS
2007
15 years 8 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
SIAMMAX
2010
224views more  SIAMMAX 2010»
15 years 1 months ago
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
Jianlin Xia, Ming Gu
TIT
2010
115views Education» more  TIT 2010»
15 years 1 months ago
On resource allocation in fading multiple-access channels-an efficient approximate projection approach
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
WWW
2009
ACM
16 years 7 months ago
Answering approximate queries over autonomous web databases
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
Xiangfu Meng, Z. M. Ma, Li Yan