2681 search results - page 164 / 537 » Problem F |
130
Voted
CVPR
2003
IEEE
16 years 4 months ago
2003
IEEE
We consider the problem of learning with instances defined over a space of sets of vectors. We derive a new positive definite kernel f(A B) defined over pairs of matrices A B base...
122
click to vote
DAC
2008
ACM
16 years 3 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
133
Voted
COLT
2006
Springer
15 years 5 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
112
click to vote
CONSTRAINTS
2010
15 years 2 months ago
2010
Abstract. We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of [2]). We show that the statement of this t...
138
click to vote
BMCBI
2004
15 years 2 months ago
2004
Background: Two or more factor mixed factorial experiments are becoming increasingly common in microarray data analysis. In this case study, the two factors are presence (Patients...