4488 search results - page 352 / 898 » Properties of NP-Complete Sets |
227
click to vote
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
172
click to vote
ICCAD
2006
IEEE
16 years 4 months ago
2006
IEEE
It has been shown that the delay of a target path can be composed linearly of other path delays. If the later paths are robustly testable (with known delay values), the target pat...
232
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Multiple instance (MI) learning is a recent learning paradigm that is more flexible than standard supervised learning algorithms in the handling of label ambiguity. It has been u...
224
click to vote
MICCAI
2009
Springer
16 years 2 months ago
2009
Springer
This paper investigates an approach to model the space of brain images through a low-dimensional manifold. A data driven method to learn a manifold from a collections of brain imag...
158
click to vote
WDAG
2009
Springer
16 years 2 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...