Sciweavers

29908 search results - page 5676 / 5982
» On the Complexity of
Sort
View
210
Voted
AMAI
2007
Springer
15 years 6 months ago
Relational concept discovery in structured datasets
Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as d...
Marianne Huchard, Mohamed Rouane Hacene, Cyril Rou...
156
Voted
APAL
2010
124views more  APAL 2010»
15 years 6 months ago
The effective theory of Borel equivalence relations
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...
Ekaterina B. Fokina, Sy-David Friedman, Asger T&ou...
159
Voted
AML
2008
124views more  AML 2008»
15 years 6 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
ARTMED
2010
119views more  ARTMED 2010»
15 years 6 months ago
Fuzzy Arden Syntax: A fuzzy programming language for medicine
Objective: The programming language Arden Syntax has been optimised for use in clinical decision support systems. We describe an extension of this language named Fuzzy Arden Synta...
Thomas Vetterlein, Harald Mandl, Klaus-Peter Adlas...
160
Voted
APPML
2007
101views more  APPML 2007»
15 years 6 months ago
Extension of a theorem of Whitney
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
Paul C. Kainen, Shannon Overbay
« Prev « First page 5676 / 5982 Last » Next »