Sciweavers

7648 search results - page 1130 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
MDM
2009
Springer
123views Communications» more  MDM 2009»
15 years 11 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
ISM
2008
IEEE
111views Multimedia» more  ISM 2008»
15 years 11 months ago
Secure and Low Cost Selective Encryption for JPEG2000
Selective encryption is a new trend in content protection. It aims at reducing the amount of data to encrypt while achieving a sufficient and inexpensive security. This approach ...
Ayoub Massoudi, Frédéric Lefè...
VRCAI
2006
ACM
15 years 10 months ago
Kinetic bounding volume hierarchies for deformable objects
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
Gabriel Zachmann, Rene Weller
SIGMETRICS
1992
ACM
145views Hardware» more  SIGMETRICS 1992»
15 years 8 months ago
Analysis of the Generalized Clock Buffer Replacement Scheme for Database Transaction Processing
The CLOCK algorithm is a popular buffer replacement algorithm becauseof its simplicity and its ability to approximate the performance of the Least Recently Used (LRU) replacement ...
Victor F. Nicola, Asit Dan, Daniel M. Dias
CIDM
2007
IEEE
15 years 8 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
« Prev « First page 1130 / 1530 Last » Next »