Sciweavers

16430 search results - page 517 / 3286
» On Computable Tree Functions
Sort
View
ICPP
2009
IEEE
16 years 1 months ago
Fine-grain Parallelism Using Multi-core, Cell/BE, and GPU Systems: Accelerating the Phylogenetic Likelihood Function
We are currently faced with the situation where applications have increasing computational demands and there is a wide selection of parallel processor systems. In this paper we fo...
Frederico Pratas, Pedro Trancoso, Alexandros Stama...
ARITH
2007
IEEE
16 years 1 months ago
Floating-point L2-approximations to functions
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
Nicolas Brisebarre, Guillaume Hanrot
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 7 months ago
On Functional Decomposition of Multivariate Polynomials with Differentiation and Homogenization
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...
Shang-Wei Zhao, Ruyong Feng, Xiao-Shan Gao
ENTCS
2007
101views more  ENTCS 2007»
15 years 7 months ago
A Framework for Timed Concurrent Constraint Programming with External Functions
The timed concurrent constraint programming language (tccp in short) was introduced for modeling reactive systems. This language allows one to model in a very intuitive way typica...
María Alpuente, Bernhard Gramlich, Alicia V...
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 7 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...