Sciweavers

8512 search results - page 70 / 1703
» Computing Theory With Relevance
Sort
View
SLOGICA
2010
138views more  SLOGICA 2010»
13 years 6 months ago
Extensionality and Restriction in Naive Set Theory
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
Zach Weber
APAL
2011
13 years 3 months ago
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories
The Suslin operator E1 is a type-2 functional testing for the wellfoundedness of binary relations on the natural numbers. In the context of applicative theories, its proof-theoret...
Gerhard Jäger, Dieter Probst
ICML
2004
IEEE
14 years 9 months ago
Margin based feature selection - theory and algorithms
Feature selection is the task of choosing a small set out of a given set of features that capture the relevant properties of the data. In the context of supervised classification ...
Ran Gilad-Bachrach, Amir Navot, Naftali Tishby
ICASSP
2008
IEEE
14 years 2 months ago
Mutual information based relevance network analysis: a Parkinson'S disease study
Monitoring the dynamics of networks in the brain is of central importance in normal and disease states. Current methods of detecting networks in the recorded EEG such as correlati...
Pamela Wen-Hsin Lee, Z. Jane Wang, Martin J. McKeo...
CIBCB
2005
IEEE
14 years 1 months ago
Predicting Single Genes Related to Immune-Relevant Processes
— In this paper we address the problem of predicting gene activities by finding gene regulatory dependencies in experimental DNA microarray data. Only few approaches to infer th...
Christian Spieth, Felix Streichert, Nora Speer, Ch...