Sciweavers

3731 search results - page 608 / 747
» cases 2006
Sort
View
99
Voted
CORR
2006
Springer
120views Education» more  CORR 2006»
15 years 23 days ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
94
Voted
CORR
2006
Springer
77views Education» more  CORR 2006»
15 years 23 days ago
Quantization Bounds on Grassmann Manifolds and Applications to MIMO Communications
This paper considers the quantization problem on the Grassmann manifold Gn,p, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The ch...
Wei Dai, Youjian Liu, Brian Rider
85
Voted
CORR
2006
Springer
113views Education» more  CORR 2006»
15 years 23 days ago
Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme
How to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decod...
Sheng Yang, Jean-Claude Belfiore
88
Voted
CORR
2006
Springer
93views Education» more  CORR 2006»
15 years 23 days ago
Functional dissipation microarrays for classification
In this article, we describe a new method of extracting information from signals, called functional dissipation, that proves to be very effective for enhancing classification of h...
D. Napoletani, Daniele C. Struppa, T. Sauer, V. Mo...
113
Voted
CORR
2006
Springer
160views Education» more  CORR 2006»
15 years 23 days ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer