Sciweavers

6800 search results - page 1260 / 1360
» On optimizing collective communication
Sort
View
CPAIOR
2011
Springer
13 years 15 days ago
Upgrading Shortest Paths in Networks
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
Bistra N. Dilkina, Katherine J. Lai, Carla P. Gome...
IACR
2011
97views more  IACR 2011»
12 years 8 months ago
Two-Output Secure Computation with Malicious Adversaries
We present a method to compile Yao’s two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability. Our ap...
Abhi Shelat, Chih-Hao Shen
TMC
2012
11 years 11 months ago
The Boomerang Protocol: Tying Data to Geographic Locations in Mobile Disconnected Networks
—We present the boomerang protocol to efficiently retain information at a particular geographic location in a sparse network of highly mobile nodes without using infrastructure ...
Tingting Sun, Bin Zan, Yanyong Zhang, Marco Grutes...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 2 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
ECCV
2008
Springer
14 years 11 months ago
Compressive Sensing for Background Subtraction
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
Volkan Cevher, Aswin C. Sankaranarayanan, Marco F....
« Prev « First page 1260 / 1360 Last » Next »