Sciweavers

2440 search results - page 201 / 488
» Explanation-Based Feature Construction
Sort
View
FSE
2009
Springer
125views Cryptology» more  FSE 2009»
16 years 5 months ago
On the Security of Tandem-DM
Abstract. We provide the first proof of security for Tandem-DM, one of the oldest and most wellknown constructions for turning a blockcipher with n-bit blocklength and 2n-bit keyle...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
POPL
2006
ACM
16 years 5 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
OSDI
2008
ACM
16 years 5 months ago
HiLighter: Automatically Building Robust Signatures of Performance Behavior for Small- and Large-Scale Systems
Previous work showed that statistical analysis techniques could successfully be used to construct compact signatures of distinct operational problems in Internet server systems. B...
Armando Fox, Moisés Goldszmidt, Peter Bod&i...
EDBT
2004
ACM
119views Database» more  EDBT 2004»
16 years 5 months ago
NNH: Improving Performance of Nearest-Neighbor Searches Using Histograms
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
Liang Jin, Nick Koudas, Chen Li
ICFP
2008
ACM
16 years 4 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy