Sciweavers

23119 search results - page 113 / 4624
» From Domain to Requirements
Sort
View
AIED
2005
Springer
15 years 8 months ago
A Knowledge Acquisition System for Constraint-based Intelligent Tutoring Systems
Building a domain model consumes a major portion of the time and effort required for building an Intelligent Tutoring System. Past attempts at reducing the knowledge acquisition bo...
Pramuditha Suraweera, Antonija Mitrovic, Brent Mar...
JOT
2010
186views more  JOT 2010»
15 years 4 months ago
The Discrete Fourier Transform, Part 6: Cross-Correlation
This paper is part 6 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on correlation....
Douglas Lyon
ESWA
2008
309views more  ESWA 2008»
15 years 6 months ago
TextOntoEx: Automatic ontology construction from natural English text
Most of existing ontologies construction tools support construction of ontological relations (e.g. taxonomy, equivalence, etc.) but they do not support construction of domain rela...
Mohamed Yehia Dahab, Hesham A. Hassan, Ahmed A. Ra...

Publication
353views
16 years 4 months ago
Shape from Shading with Perspective Projection
Most conventional SFS (shape from shading) algorithms have been developed under the assumption of orthographic projection. However, the assumption is not valid when an object is no...
Kyoung Mu Lee (Seoul National University), C.-C. J...
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 6 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto