Sciweavers

903 search results - page 70 / 181
» On the reduction of a random basis
Sort
View
CORR
2006
Springer
110views Education» more  CORR 2006»
15 years 6 months ago
Definitions by Rewriting in the Calculus of Constructions
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
Frédéric Blanqui
PKC
1999
Springer
102views Cryptology» more  PKC 1999»
15 years 10 months ago
How to Enhance the Security of Public-Key Encryption at Minimum Cost
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure...
Eiichiro Fujisaki, Tatsuaki Okamoto
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
13 years 8 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 6 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
COMPSAC
2010
IEEE
15 years 4 months ago
GenRed: A Tool for Generating and Reducing Object-Oriented Test Cases
An important goal of automatic testing techniques, including random testing is to achieve high code coverage with a minimum set of test cases. To meet this goal, random testing res...
Hojun Jaygarl, Kai-Shin Lu, Carl K. Chang