Sciweavers

16430 search results - page 519 / 3286
» On Computable Tree Functions
Sort
View
ICIC
2005
Springer
16 years 16 days ago
Orthogonal Forward Selection for Constructing the Radial Basis Function Network with Tunable Nodes
Abstract. An orthogonal forward selection (OFS) algorithm based on the leaveone-out (LOO) criterion is proposed for the construction of radial basis function (RBF) networks with tu...
Sheng Chen, Xia Hong, Chris J. Harris
PERVASIVE
2004
Springer
16 years 11 days ago
SearchLight - A Lightweight Search Function for Pervasive Environments
We present a lightweight search function for physical objects in instrumented environments. Objects are tagged with optical markers which are scanned by a steerable camera and pro...
Andreas Butz, Michael Schneider, Mira Spassova
FQ
2003
Springer
16 years 7 days ago
Everywhere Ramified Towers of Global Function Fields
We construct a tower of function fields F0 ⊂ F1 ⊂ . . . over a finite field such that every place of every Fi ramifies in the tower and lim genus(Fi)/[Fi : F0] < ∞. We...
Iwan M. Duursma, Bjorn Poonen, Michael Zieve
IPPS
2002
IEEE
15 years 12 months ago
Multipartite Tables in JBits for the Evaluation of Functions on FPGAs
This paper presents the implementation, on Virtex FPGAs, of a core generator for arbitrary numeric functions in fixed-point format. The cores use the state-of-theart multipartite...
Jérémie Detrey, Florent de Dinechin
AAECC
2007
Springer
132views Algorithms» more  AAECC 2007»
15 years 7 months ago
Approximate implicitization of planar curves by piecewise rational approximation of the distance function
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
Mohamed Shalaby, Bert Jüttler, Josef Schicho