Sciweavers

124 search results - page 23 / 25
» Dimension Is Compression
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
On optimal channel training for uplink network MIMO systems
We study a multi-cell frequency-selective fading uplink channel from K user terminals (UTs) to B base stations (BSs). The BSs, assumed to be oblivious of the applied encoding sche...
Jakob Hoydis, Mari Kobayashi, Mérouane Debb...
CIKM
2011
Springer
12 years 7 months ago
SIMD-based decoding of posting lists
Powerful SIMD instructions in modern processors offer an opportunity for greater search performance. In this paper, we apply these instructions to decoding search engine posting ...
Alexander A. Stepanov, Anil R. Gangolli, Daniel E....
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 7 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
AUSAI
2007
Springer
14 years 1 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
CVPR
2005
IEEE
14 years 9 months ago
Rank-R Approximation of Tensors: Using Image-as-Matrix Representation
We present a novel multilinear algebra based approach for reduced dimensionality representation of image ensembles. We treat an image as a matrix, instead of a vector as in tradit...
Hongcheng Wang, Narendra Ahuja