Sciweavers

26 search results - page 3 / 6
» Finding Reasons and Conclusion in a Basic Computer Science C...
Sort
View
ARTMED
2006
80views more  ARTMED 2006»
13 years 9 months ago
A formal theory for spatial representation and reasoning in biomedical ontologies
Objective: The objective of this paper is to demonstrate how a formal spatial theory can be used as an important tool for disambiguating the spatial information embodied in biomed...
Maureen Donnelly, Thomas Bittner, Cornelius Rosse
CSO
2009
IEEE
14 years 4 months ago
Association Rules Based Data Mining on Test Data of Physical Health Standard
With the development of modern electronic and computer technologies, sports training and competition became more and more technical. A great deal of data were recorded, including ...
Lan Yu
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
14 years 1 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
SIGSOFT
2007
ACM
14 years 10 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
CSL
2006
Springer
14 years 1 months ago
Nonmonotonic Logics and Their Algebraic Foundations
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...
Miroslaw Truszczynski