Sciweavers

3466 search results - page 45 / 694
» Fast computation of special resultants
Sort
View
STRINGOLOGY
2008
14 years 12 days ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
CIE
2005
Springer
14 years 4 months ago
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...
Jérôme Durand-Lose
INCDM
2009
Springer
131views Data Mining» more  INCDM 2009»
14 years 5 months ago
Computer-Aided Diagnosis in Brain Computed Tomography Screening
Currently, interpretation of medical images is almost exclusively made by specialized physicians. Although, the next decades will most certainly be of change and computer-aided dia...
Hugo Peixoto, Victor Alves
LCTRTS
2010
Springer
14 years 5 months ago
Elastic computing: a framework for transparent, portable, and adaptive multi-core heterogeneous computing
Over the past decade, system architectures have started on a clear trend towards increased parallelism and heterogeneity, often resulting in speedups of 10x to 100x. Despite numer...
John Robert Wernsing, Greg Stitt
SIAMSC
2008
168views more  SIAMSC 2008»
13 years 11 months ago
Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi