Sciweavers

8824 search results - page 1542 / 1765
» On the Complexity of Real Functions
Sort
View
ENGL
2008
186views more  ENGL 2008»
15 years 6 months ago
High Performance Monte-Carlo Based Option Pricing on FPGAs
High performance computing is becoming increasingly important in the field of financial computing, as the complexity of financial models continues to increase. Many of these financ...
Xiang Tian, Khaled Benkrid, Xiaochen Gu
AO
2006
127views more  AO 2006»
15 years 6 months ago
Formal ontology meets industry
in ontology is quite abstract and often based on toy-examples to the point that the gap between the work of theoreticians and the needs of real applications is too wide to be cross...
Stefano Borgo, Matteo Cristani, Roberta Cuel
FOCM
2008
100views more  FOCM 2008»
15 years 6 months ago
A Unifying Local Convergence Result for Newton's Method in Riemannian Manifolds
We consider the problem of finding a singularity of a differentiable vector field X defined on a complete Riemannian manifold. We prove a unified result for the existence and local...
Felipe Alvarez, Jérôme Bolte, Julien ...
BMCBI
2006
101views more  BMCBI 2006»
15 years 6 months ago
SynTReN: a generator of synthetic gene expression data for design and analysis of structure learning algorithms
Background: The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validatio...
Tim Van den Bulcke, Koen Van Leemput, Bart Naudts,...
BMCBI
2006
100views more  BMCBI 2006»
15 years 6 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
« Prev « First page 1542 / 1765 Last » Next »