4066 search results - page 376 / 814 » Almost Complete Sets |
204
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
178
click to vote
PAMI
2006
15 years 6 months ago
2006
This paper explores the power and the limitations of weakly supervised categorization. We present a complete framework that starts with the extraction of various local regions of e...
173
click to vote
AMAI
2005
Springer
15 years 6 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
181
click to vote
IGPL
1998
15 years 6 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
177
click to vote
FUIN
2010
15 years 5 months ago
2010
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...