Sciweavers

1998 search results - page 204 / 400
» Complexity of the Cover Polynomial
Sort
View
ECCC
2011
217views ECommerce» more  ECCC 2011»
14 years 10 months ago
ReachFewL = ReachUL
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
Brady Garvin, Derrick Stolee, Raghunath Tewari, N....
EUROCRYPT
2011
Springer
14 years 10 months ago
Implementing Gentry's Fully-Homomorphic Encryption Scheme
We describe a working implementation of a variant of Gentry’s fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort b...
Craig Gentry, Shai Halevi

Book
411views
17 years 4 months ago
Concrete Abstractions
"This book has evolved from materials used in an undergraduate course intended for final year undergraduate students whose background includes at least one year's experie...
Max Hailperin, Barbara Kaiser, and Karl Knight
SIGMOD
2007
ACM
122views Database» more  SIGMOD 2007»
16 years 6 months ago
XQuery layers
XML is the data interoperability standard in many application domains. Therefore, an increasing number of researchers and professionals, who are not computer scientists (although ...
Daniele Braga, Alessandro Campi, Stefano Ceri, Pao...
EDBT
2006
ACM
120views Database» more  EDBT 2006»
16 years 6 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...