Sciweavers

1920 search results - page 95 / 384
» The Complexity of the A B C Problem
Sort
View
CORR
1999
Springer
65views Education» more  CORR 1999»
15 years 5 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe
NAR
2007
62views more  NAR 2007»
15 years 5 months ago
MolProbity: all-atom contacts and structure validation for proteins and nucleic acids
MolProbity is a general-purpose web server offering quality validation for 3D structures of proteins, nucleic acids and complexes. It provides detailed all-atom contact analysis o...
Ian W. Davis, Andrew Leaver-Fay, Vincent B. Chen, ...
WWW
2011
ACM
15 years 1 months ago
Towards semantic knowledge propagation from text corpus to web images
In this paper, we study the problem of transfer learning from text to images in the context of network data in which link based bridges are available to transfer the knowledge bet...
Guojun Qi, Charu C. Aggarwal, Thomas Huang
VLDB
2007
ACM
104views Database» more  VLDB 2007»
16 years 6 months ago
Extending Dependencies with Conditions
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
Loreto Bravo, Wenfei Fan, Shuai Ma
NIPS
2001
15 years 7 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...