Sciweavers

467 search results - page 16 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
CORR
2007
Springer
82views Education» more  CORR 2007»
14 years 11 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
TC
2008
14 years 11 months ago
Hardware Implementation Trade-Offs of Polynomial Approximations and Interpolations
This paper examines the hardware implementation trade-offs when evaluating functions via piecewise polynomial approximations and interpolations for precisions of up to 24 bits. In ...
Dong-U Lee, Ray C. C. Cheung, Wayne Luk, John D. V...
ENTCS
2008
102views more  ENTCS 2008»
14 years 11 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
ICRA
2008
IEEE
104views Robotics» more  ICRA 2008»
15 years 6 months ago
Towards locally computable polynomial navigation functions for convex obstacle workspaces
— In this paper we present a polynomial Navigation Function (NF) for a sphere world that can be constructed almost locally, with partial knowledge of the environment. The present...
Grigoris Lionis, Xanthi Papageorgiou, Kostas J. Ky...
TNN
2008
128views more  TNN 2008»
14 years 11 months ago
Nonnegative Matrix Factorization in Polynomial Feature Space
Abstract--Plenty of methods have been proposed in order to discover latent variables (features) in data sets. Such approaches include the principal component analysis (PCA), indepe...
Ioan Buciu, Nikos Nikolaidis, Ioannis Pitas