Sciweavers

668 search results - page 33 / 134
» Hyperrelations in version space
Sort
View
127
Voted
ESOP
2008
Springer
15 years 3 months ago
Semi-persistent Data Structures
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
Sylvain Conchon, Jean-Christophe Filliâtre
IWMMDBMS
1996
64views more  IWMMDBMS 1996»
15 years 3 months ago
Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...
Renato Pajarola, Peter Widmayer
89
Voted
JOC
2006
77views more  JOC 2006»
15 years 1 months ago
An Improved Real-Quadratic-Field-Based Key Exchange Procedure
To date, the only non-group structure that has been suitably employed as the key space for Diffie-Hellman type cryptographic key exchange is the infrastructure of a real quadratic ...
Michael J. Jacobson Jr., Renate Scheidler, Hugh C....
87
Voted
FOCS
1998
IEEE
15 years 6 months ago
The Finite Capacity Dial-A-Ride Problem
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
Moses Charikar, Balaji Raghavachari
116
Voted
TC
2008
15 years 1 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...