Sciweavers

350 search results - page 54 / 70
» Lower and upper bounds on obtaining history independence
Sort
View
TSMC
2010
14 years 6 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
ICC
2007
IEEE
123views Communications» more  ICC 2007»
15 years 6 months ago
The Effect of Ordered Detection and Antenna Selection on Diversity Gain of Decision Feedback Detector
— The decision feedback detector (DFD) can achieve the high spectral efficiency of a MIMO channel in that it converts the MIMO channel into multiple parallel layers, through whi...
Yi Jiang, Mahesh K. Varanasi
CORR
1998
Springer
105views Education» more  CORR 1998»
14 years 11 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas
JCT
2010
81views more  JCT 2010»
14 years 10 months ago
On the probability of a rational outcome for generalized social welfare functions on three alternatives
In [11], Kalai investigated the probability of a rational outcome for a generalized social welfare function (GSWF) on three alternatives, when the individual preferences are unifo...
Nathan Keller
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
15 years 9 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos