Sciweavers

209 search results - page 40 / 42
» Monte Carlo Go Has a Way to Go
Sort
View
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 5 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
EDBT
2011
ACM
222views Database» more  EDBT 2011»
12 years 9 months ago
The hidden web, XML and the Semantic Web: scientific data management perspectives
The World Wide Web no longer consists just of HTML pages. Our work sheds light on a number of trends on the Internet that go beyond simple Web pages. The hidden Web provides a wea...
Fabian M. Suchanek, Aparna S. Varde, Richi Nayak, ...
IACR
2011
158views more  IACR 2011»
12 years 5 months ago
Can Homomorphic Encryption be Practical?
Abstract. The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns for individuals and businesses alike. T...
Kristin Lauter, Michael Naehrig, Vinod Vaikuntanat...
SIGCOMM
2012
ACM
11 years 8 months ago
Perspectives on network calculus: no free lunch, but still good value
ACM Sigcomm 2006 published a paper [26] which was perceived to unify the deterministic and stochastic branches of the network calculus (abbreviated throughout as DNC and SNC) [39]...
Florin Ciucu, Jens Schmitt
ICDT
2012
ACM
293views Database» more  ICDT 2012»
11 years 8 months ago
On the complexity of query answering over incomplete XML documents
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
Amélie Gheerbrant, Leonid Libkin, Tony Tan