Sciweavers

4095 search results - page 742 / 819
» How to test a tree
Sort
View
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
14 years 8 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...
EUROSYS
2006
ACM
14 years 5 months ago
A quantitative analysis of aspects in the eCos kernel
Nearly ten years after its first presentation and five years after its first application to operating systems, the suitability of AspectOriented Programming (AOP) for the devel...
Daniel Lohmann, Fabian Scheler, Reinhard Tartler, ...
ALT
2008
Springer
14 years 4 months ago
Computational Models of Neural Representations in the Human Brain
Abstract For many centuries scientists have wondered how the human brain represents thoughts in terms of the underlying biology of neural activity. Philosophers, linguists, cogniti...
Tom M. Mitchell
ALT
2006
Springer
14 years 4 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen
STACS
2010
Springer
14 years 2 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen