Sciweavers

2924 search results - page 520 / 585
» Lower Bounds in Distributed Computing
Sort
View
143
Voted
ICS
2010
Tsinghua U.
15 years 12 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
144
Voted
ECCV
2004
Springer
16 years 4 months ago
Accuracy of Spherical Harmonic Approximations for Images of Lambertian Objects under Far and Near Lighting
Various problems in Computer Vision become difficult due to a strong influence of lighting on the images of an object. Recent work showed analytically that the set of all images of...
Darya Frolova, Denis Simakov, Ronen Basri
122
Voted
PVLDB
2008
116views more  PVLDB 2008»
15 years 2 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
137
Voted
MOBISYS
2007
ACM
16 years 2 months ago
COMBINE: leveraging the power of wireless peers through collaborative downloading
Mobile devices are increasingly equipped with multiple network interfaces: Wireless Local Area Network (WLAN) interfaces for local connectivity and Wireless Wide Area Network (WWA...
Ganesh Ananthanarayanan, Venkata N. Padmanabhan, L...
129
Voted
MOBIHOC
2008
ACM
16 years 2 months ago
Delegation forwarding
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
Vijay Erramilli, Mark Crovella, Augustin Chaintrea...