Sciweavers

113 search results - page 8 / 23
» Large Subposets with Small Dimension
Sort
View
SIGCOMM
2010
ACM
14 years 9 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...
MHCI
2007
Springer
15 years 3 months ago
Sensing-based interaction for information navigation on handheld displays
Information navigation on handheld displays is characterized by the small display dimensions and limited input capabilities of today’s mobile devices. Special strategies are req...
Michael Rohs, Georg Essl
CLUSTER
2006
IEEE
15 years 3 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...
AVBPA
2005
Springer
308views Biometrics» more  AVBPA 2005»
15 years 3 months ago
Biometric Recognition Using Feature Selection and Combination
Most of the prior work in biometric literature has only emphasized on the issue of feature extraction and classification. However, the critical issue of examining the usefulness of...
Ajay Kumar, David Zhang
EUROPAR
2003
Springer
15 years 2 months ago
Improving Performance of Hypermatrix Cholesky Factorization
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
José R. Herrero, Juan J. Navarro