Sciweavers

377 search results - page 4 / 76
» A Value Theory of Meta-Learning Algorithms
Sort
View
55
Voted
KES
2010
Springer
14 years 8 months ago
Extracting Principal Components from Pseudo-random Data by Using Random Matrix Theory
We develop a methodology to grasp temporal trend in a stock market that changes year to year, or sometimes within a year depending on numerous factors. For this purpose, we employ ...
Mieko Tanaka-Yamawaki
CADE
2008
Springer
15 years 9 months ago
Towards Fully Automated Axiom Extraction for Finite-Valued Logics
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
Dalmo Mendonca, João Marcos
SIAMMAX
2010
164views more  SIAMMAX 2010»
14 years 4 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
DATAMINE
2007
93views more  DATAMINE 2007»
14 years 9 months ago
Evaluation of ordinal attributes at value level
We propose a novel context sensitive algorithm for evaluation of ordinal attributes which exploits the information hidden in ordering of attributes’ and class’ values and prov...
Marko Robnik-Sikonja, Koen Vanhoof
MOC
2000
122views more  MOC 2000»
14 years 9 months ago
Explicit resolutions of cubic cusp singularities
Resolutions of cusp singularities are crucial to many techniques in computational number theory, and therefore finding explicit resolutions of these singularities has been the focu...
H. G. Grundman