Sciweavers

374 search results - page 60 / 75
» Fast separable factorization and applications
Sort
View
DOLAP
1999
ACM
13 years 12 months ago
A Dynamic Load Balancing Strategy for Parallel Datacube Computation
In recent years, OLAP technologies have become one of the important applications in the database industry. In particular, the datacube operation proposed in [5] receives strong at...
Seigo Muto, Masaru Kitsuregawa
ICCCN
1997
IEEE
13 years 11 months ago
Time dependent priority scheduling for guaranteed QoS systems
With the advances in server technology, and the advent of fast Gigabit networks, it has become possible to support multi-media applications. To support the requirements for the tr...
Shailender Chaudhry, Alok N. Choudhary
EDBT
2006
ACM
154views Database» more  EDBT 2006»
13 years 11 months ago
Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
Christoph Brochhaus, Marc Wichterich, Thomas Seidl
ASIACRYPT
2008
Springer
13 years 9 months ago
Twisted Edwards Curves Revisited
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
Hüseyin Hisil, Kenneth Koon-Ho Wong, Gary Car...
MASCOTS
2001
13 years 9 months ago
Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
Zhi Li, John Higgins, Mark J. Clement