Sciweavers

489 search results - page 85 / 98
» Approximation Algorithms for the Minimum-Length Corridor and...
Sort
View
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
14 years 7 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
13 years 11 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
IPPS
1996
IEEE
13 years 11 months ago
The Chessboard Distance Transform and the Medial Axis Transform are Interchangeable
The distance transform (DT) and the medial axis transform (MAT) are two image computation tools used to extract the information about the shape and the position of the foreground ...
Yu-Hua Lee, Shi-Jinn Horng
ECML
1993
Springer
13 years 11 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman
ATAL
2009
Springer
14 years 2 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...