Sciweavers

76 search results - page 2 / 16
» Lower Bounds for Additive Spanners, Emulators, and More
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
ECCC
2007
144views more  ECCC 2007»
13 years 4 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
SAT
2004
Springer
97views Hardware» more  SAT 2004»
13 years 10 months ago
Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization
Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...
Vasco M. Manquinho, João P. Marques Silva
ICC
2007
IEEE
105views Communications» more  ICC 2007»
13 years 11 months ago
Lower Bounds on the Capacity Regions of the Relay Channel and the Cooperative Relay-Broadcast Channel with Non-Causal Side Infor
— In this work, coding for the relay channel (RC) and the cooperative relay broadcast channel (RBC) controlled by random parameters are studied. In the first channel, the RC, in...
Abdellatif Zaidi, Luc Vandendorpe, Pierre Duhamel
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 4 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...