Sciweavers

126 search results - page 20 / 26
» Storing a Compressed Function with Constant Time Access
Sort
View
PVLDB
2008
113views more  PVLDB 2008»
13 years 6 months ago
Rewriting procedures for batched bindings
Queries, or calls to stored procedures/user-defined functions are often invoked multiple times, either from within a loop in an application program, or from the where/select claus...
Ravindra Guravannavar, S. Sudarshan
POPL
2008
ACM
14 years 8 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
RTCSA
2008
IEEE
14 years 2 months ago
Efficient Query Processing for Tracing RFID Tags by Reordering Location Identifiers
This paper addresses the problem of using the Location IDentifier (LID) as the domain value of the index for trajectories of RFID tags and proposes the solution for solving this p...
Sungwoo Ahn, Bonghee Hong
EUROCRYPT
2010
Springer
14 years 15 days ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...
CGF
2004
118views more  CGF 2004»
13 years 7 months ago
Cultural Heritage Preservation Using Constructive Shape Modeling
Issues of digital preservation of shapes and internal structures of historical cultural objects are discussed. An overview of existing approaches to digital preservation related t...
Carl Vilbrandt, Galina Pasko, Alexander A. Pasko, ...