Sciweavers

63 search results - page 7 / 13
» Lookup Tables, Recurrences and Complexity
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
ICCD
2006
IEEE
139views Hardware» more  ICCD 2006»
14 years 4 months ago
Perceptron Based Consumer Prediction in Shared-Memory Multiprocessors
Abstract— Recent research has shown that forwarding speculative data to other processors before it is requested can improve the performance of multiprocessor systems. The most re...
Sean Leventhal, Manoj Franklin
IMAGING
2003
13 years 9 months ago
Spectral Color Processing Using an Interim Connection Space
The use of an Interim Connection Space (ICS) is proposed as a means for extending the concept of device independent color management to support spectral imaging. Color management,...
Mitchell R. Rosen, Noboru Ohta
CCR
2007
86views more  CCR 2007»
13 years 7 months ago
An addressing independent networking structure favorable for all-optical packet switching
All-optical packet switching (AOPS) technology is essential to fully utilize the tremendous bandwidth provided by advanced optical communication techniques through forwarding pack...
Shengming Jiang
ECCV
2010
Springer
14 years 23 days ago
Fast Covariance Computation and Dimensionality Reduction for Sub-Window Features in Images
This paper presents algorithms for efficiently computing the covariance matrix for features that form sub-windows in a large multidimensional image. For example, several image proc...