Sciweavers

903 search results - page 58 / 181
» On the reduction of a random basis
Sort
View
TSP
2010
15 years 25 days ago
Robust precoding with Bayesian error modeling for limited feedback MU-MISO systems
We consider the robust precoder design for Multi-User Multiple Input Single Output (MU-MISO) systems where the Channel State Information (CSI) is fed back from the single antenna ...
Michael Joham, Paula Maria Castro, Luis Castedo, W...
FOCS
1998
IEEE
15 years 10 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
Daniele Micciancio
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 6 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford
ICCAD
2004
IEEE
100views Hardware» more  ICCAD 2004»
16 years 3 months ago
A chip-level electrostatic discharge simulation strategy
This paper presents a chip-level charged device model (CDM) electrostatic discharge (ESD) simulation method. The chip-level simulation is formulated as a DC analysis problem. A ne...
Haifeng Qian, Joseph N. Kozhaya, Sani R. Nassif, S...
FOCS
2008
IEEE
16 years 18 days ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly