Sciweavers

450 search results - page 85 / 90
» Satisfiability with Exponential Families
Sort
View
CORR
2010
Springer
184views Education» more  CORR 2010»
14 years 9 months ago
Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
We consider a Gaussian two-hop network where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine adversary. Both the s...
Xiang He, Aylin Yener
CRYPTO
2011
Springer
195views Cryptology» more  CRYPTO 2011»
13 years 9 months ago
Time-Lock Puzzles in the Random Oracle Model
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
ICDE
2003
IEEE
139views Database» more  ICDE 2003»
15 years 10 months ago
Super-Fast XML Wrapper Generation in DB2: A Demonstration
The XML Wrapper is a new feature of the federated database capabilities of DB2/UDB v8. It enables users and applications to issue SQL queries against XML data from a variety of so...
Vanja Josifovski, Sabine Massmann, Felix Naumann
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
15 years 10 months ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
15 years 9 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...