Sciweavers

9683 search results - page 1510 / 1937
» Predicting query performance
Sort
View
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 10 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
CLEF
2006
Springer
15 years 10 months ago
CLEF 2006: Ad Hoc Track Overview
We describe the objectives and organization of the CLEF 2006 ad hoc track and discuss the main characteristics of the tasks offered to test monolingual, bilingual, and multilingual...
Giorgio Maria Di Nunzio, Nicola Ferro, Thomas Mand...
ICCV
2009
IEEE
15 years 4 months ago
On optimizing subspaces for face recognition
We propose a subspace learning algorithm for face recognition by directly optimizing recognition performance scores. Our approach is motivated by the following observations: 1) Di...
Jilin Tu, Xiaoming Liu, Peter Henry Tu
TDSC
2010
119views more  TDSC 2010»
15 years 1 months ago
On the General Applicability of Instruction-Set Randomization
We describe Instruction-Set Randomization (ISR), a general approach for safeguarding systems against any type of code-injection attack. We apply Kerckhoffs' principle to creat...
Stephen W. Boyd, Gaurav S. Kc, Michael E. Locasto,...
DAC
2002
ACM
16 years 7 months ago
DRG-cache: a data retention gated-ground cache for low power
In this paper we propose a novel integrated circuit and architectural level technique to reduce leakage power consumption in high performance cache memories using single Vt (trans...
Amit Agarwal, Hai Li, Kaushik Roy
« Prev « First page 1510 / 1937 Last » Next »