Sciweavers

68 search results - page 1 / 14
» Realizability algebras: a program to well order R
Sort
View
39
Voted
CORR
2010
Springer
46views Education» more  CORR 2010»
15 years 17 days ago
Realizability algebras: a program to well order R
Jean-Louis Krivine
59
Voted
CSL
2007
Springer
15 years 6 months ago
Linear Realizability
We define a notion of relational linear combinatory algebra (rLCA) which is a generalization of a linear combinatory algebra defined by Abramsky, Haghverdi and Scott. We also de...
Naohiko Hoshino
BMCBI
2010
155views more  BMCBI 2010»
15 years 17 days ago
A flexible R package for nonnegative matrix factorization
Background: Nonnegative Matrix Factorization (NMF) is an unsupervised learning technique that has been applied successfully in several fields, including signal processing, face re...
Renaud Gaujoux, Cathal Seoighe
85
Voted
MOC
2000
79views more  MOC 2000»
15 years 7 days ago
On fundamental domains of arithmetic Fuchsian groups
Let K be a totally real algebraic number field and O an order in a quaternion algebra A over K. Assume that the group O1 of units in O with reduced norm equal to 1 is embedded into...
Stefan J. Johansson
112
Voted
ICML
1989
IEEE
15 years 4 months ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning