Sciweavers

6202 search results - page 223 / 1241
» Without Loss of Generality
Sort
View
SIGMOD
2004
ACM
112views Database» more  SIGMOD 2004»
16 years 6 months ago
ORDPATHs: Insert-Friendly XML Node Labels
We introduce a hierarchical labeling scheme called ORDPATH that is implemented in the upcoming version of Microsoft? SQL ServerTM. ORDPATH labels nodes of an XML tree without requ...
Patrick E. O'Neil, Elizabeth J. O'Neil, Shankar Pa...
TCC
2007
Springer
146views Cryptology» more  TCC 2007»
16 years 22 days ago
Conjunctive, Subset, and Range Queries on Encrypted Data
We construct public-key systems that support comparison queries (x ≥ a) on encrypted data as well as more general queries such as subset queries (x ∈ S). These systems support...
Dan Boneh, Brent Waters
TLCA
2007
Springer
16 years 22 days ago
An Isomorphism Between Cut-Elimination Procedure and Proof Reduction
Abstract. This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natu...
Koji Nakazawa
FOCS
2006
IEEE
16 years 20 days ago
Input-Indistinguishable Computation
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
Silvio Micali, Rafael Pass, Alon Rosen
AADEBUG
2005
Springer
15 years 8 months ago
Backtracking and dynamic patching for free
We present a way to incorporate backtracking and dynamic patching into existing debuggers, without requiring any change to their source code, the compiler or the run-time environm...
Bjorn De Sutter, Bruno De Bus, Michiel Ronsse, Koe...