Sciweavers

4930 search results - page 639 / 986
» Learning minimal abstractions
Sort
View
COMPLIFE
2006
Springer
15 years 10 months ago
Relational Subgroup Discovery for Descriptive Analysis of Microarray Data
Abstract. This paper presents a method that uses gene ontologies, together with the paradigm of relational subgroup discovery, to help find description of groups of genes different...
Igor Trajkovski, Filip Zelezný, Jakub Tolar...
FQAS
2004
Springer
135views Database» more  FQAS 2004»
15 years 10 months ago
Interactive Schema Integration with Sphinx
Abstract. The Internet has instigated a critical need for automated tools that facilitate integrating countless databases. Since non-technical end users are often the ultimate repo...
François Barbançon, Daniel P. Mirank...
CRYPTO
2006
Springer
89views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Oblivious Transfer and Linear Functions
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
CSCLP
2006
Springer
15 years 10 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
ECAI
2006
Springer
15 years 10 months ago
Automatic Generation of Implied Constraints
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
John Charnley, Simon Colton, Ian Miguel