Sciweavers

5964 search results - page 430 / 1193
» A theory of speculative computation
Sort
View
IJON
1998
44views more  IJON 1998»
15 years 7 months ago
Hierarchical RBF networks and local parameters estimate
The method presented here is aimed to a direct fast setting of the parameters of a RBF network for function approximation. It is based on a hierarchical gridding of the input spac...
N. Alberto Borghese, Stefano Ferrari
TCS
2002
15 years 7 months ago
ELAN from a rewriting logic point of view
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or ...
Peter Borovanský, Claude Kirchner, Hé...
MICS
2007
84views more  MICS 2007»
15 years 7 months ago
Pseudospectra of Matrix Polynomials that Are Expressed in Alternative Bases
Spectra and pseudospectra of matrix polynomials are of interest in geometric intersection problems, vibration problems, and analysis of dynamical systems. In this note we consider ...
Robert M. Corless, Nargol Rezvani, Amirhossein Ami...
175
Voted
EMNLP
2009
15 years 5 months ago
A Simple Unsupervised Learner for POS Disambiguation Rules Given Only a Minimal Lexicon
We propose a new model for unsupervised POS tagging based on linguistic distinctions between open and closed-class items. Exploiting notions from current linguistic theory, the sy...
Qiuye Zhao, Mitch Marcus
AML
2011
177views Mathematics» more  AML 2011»
15 years 2 months ago
A superhigh diamond in the c.e. tt-degrees
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...
Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu ...