Sciweavers

166 search results - page 27 / 34
» Efficient worst case timing analysis of data caching
Sort
View
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 9 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
ICIP
2002
IEEE
14 years 10 months ago
Real-time reconstruction of wavelet encoded meshes for view-dependent transmission and visualization
Wavelet methods for geometry encoding is a recently emerged superset of multiresolution analysis which has proven to be very efficient in term of compression and adaptive transmis...
Patrick Gioia, Oliver Aubault, Christian Bouville
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 8 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
CCS
2006
ACM
13 years 10 months ago
Dynamic rule-ordering optimization for high-speed firewall filtering
Packet filtering plays a critical role in many of the current high speed network technologies such as firewalls and IPSec devices. The optimization of firewall policies is critica...
Hazem Hamed, Ehab Al-Shaer
MOC
2010
13 years 3 months ago
The number field sieve for integers of low weight
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
Oliver Schirokauer