Sciweavers

1243 search results - page 167 / 249
» Complexity reduction of C-Algorithm
Sort
View
ICALP
2009
Springer
16 years 1 months ago
External Sampling
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
15 years 8 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
VTC
2006
IEEE
138views Communications» more  VTC 2006»
15 years 7 months ago
Transmit Precoding for the Multiple Antenna Broadcast Channel
— In this paper we compare the following two methods of transmit precoding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also term...
Manish Airy, Sandeep Bhadra, Robert W. Heath Jr., ...
ECCC
2007
86views more  ECCC 2007»
15 years 1 months ago
Interactive PCP
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
Yael Tauman Kalai, Ran Raz
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 2 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...