2661 search results - page 159 / 533 » Quantum Complexity Classes |
122
Voted
ESANN
2006
15 years 4 months ago
2006
In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exp...
128
click to vote
KRDB
2001
15 years 4 months ago
2001
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...
119
click to vote
LOGCOM
2006
15 years 3 months ago
2006
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
134
click to vote
CVPR
2000
IEEE
16 years 5 months ago
2000
IEEE
A problem of using mixture-of-Gaussian models for unsupervised texturesegmentationisthat "multimodal"textures(such ascan often be encountered in natural images) cannot b...
122
Voted
WG
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...