Sciweavers

11397 search results - page 267 / 2280
» A Relational Abstraction for Functions
Sort
View
NIPS
1994
15 years 8 months ago
Combining Estimators Using Non-Constant Weighting Functions
This paper discusses the linearly weighted combination of estimators in which the weighting functions are dependent on the input. We show that the weighting functions can be deriv...
Volker Tresp, Michiaki Taniguchi
AML
1999
86views more  AML 1999»
15 years 7 months ago
Subrecursive functions on partial sequences
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
Karl-Heinz Niggl
DM
1998
66views more  DM 1998»
15 years 7 months ago
Steep polyominoes, q-Motzkin numbers and q-Bessel functions
We introduce three deÿnitions of q-analogs of Motzkin numbers and illustrate some combinatorial interpretations of these q-numbers. We relate the ÿrst class of q-numbers to the ...
Elena Barcucci, Alberto Del Lungo, Jean-Marc Fedou...
INFORMATICALT
1998
145views more  INFORMATICALT 1998»
15 years 7 months ago
Design of Reusable VHDL Component Using External Functions
This paper describes a method how to represent and build a reusable VHDL component. By that component we can, for example, describe a family of the relative VHDL models. To represe...
Vytautas Stuikys
JMLR
2002
135views more  JMLR 2002»
15 years 7 months ago
Covering Number Bounds of Certain Regularized Linear Function Classes
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
Tong Zhang