Sciweavers

1254 search results - page 4 / 251
» Making Hard Problems Harder
Sort
View
EUROSYS
2008
ACM
14 years 4 months ago
GreenFS: making enterprise computers greener by protecting them better
Hard disks contain data—frequently an irreplaceable asset of high monetary and non-monetary value. At the same time, hard disks are mechanical devices that consume power, are no...
Nikolai Joukov, Josef Sipek
TEC
2012
195views Formal Methods» more  TEC 2012»
11 years 10 months ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López
NOLISP
2005
Springer
14 years 1 months ago
Weighting Scores to Improve Speaker-Dependent Threshold Estimation in Text-Dependent Speaker Verification
The difficulty of obtaining data from impostors and the scarcity of data are two factors that have a large influence in the estimation of speakerdependent thresholds in text-depend...
Javier R. Saeta, Javier Hernando
CIKM
2006
Springer
13 years 11 months ago
Annotation propagation revisited for key preserving views
This paper revisits the analysis of annotation propagation from source databases to views defined in terms of conjunctive (SPJ) queries. Given a source database D, an SPJ query Q,...
Gao Cong, Wenfei Fan, Floris Geerts
CMS
2006
13 years 9 months ago
TAO: Protecting Against Hitlist Worms Using Transparent Address Obfuscation
Abstract. Sophisticated worms that use precomputed hitlists of vulnerable targets are especially hard to contain, since they are harder to detect, and spread at rates where even au...
Spyros Antonatos, Kostas G. Anagnostakis