Sciweavers

1888 search results - page 99 / 378
» Proof theory and computational analysis
Sort
View
93
Voted
VIS
2007
IEEE
115views Visualization» more  VIS 2007»
16 years 1 months ago
Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications
Abstract--The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and ana...
Christoph Garth, Florian Gerhardt, Xavier Tricoc...
ISMB
1993
15 years 1 months ago
Computationally Efficient Cluster Representation in Molecular Sequence Megaclassification
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
David J. States, Nomi L. Harris, Lawrence Hunter
124
Voted
CICLING
2003
Springer
15 years 5 months ago
Computing with Realizational Morphology
The theory of realizational morphology presented by Stump in his influential book Inflectional Morphology (2001) describes the derivation of inflected surface forms from underly...
Lauri Karttunen
FOCM
2011
117views more  FOCM 2011»
14 years 7 months ago
Accuracy and Stability of Computing High-order Derivatives of Analytic Functions by Cauchy Integrals
Abstract High-order derivatives of analytic functions are expressible as Cauchy integrals over circular contours, which can very effectively be approximated, e.g., by trapezoidal s...
Folkmar Bornemann
WWW
2004
ACM
16 years 1 months ago
CTR-S: a logic for specifying contracts in semantic web services
A requirements analysis in the emerging field of Semantic Web Services (SWS) (see http://daml.org/services/swsl/requirements/) has identified four major areas of research: intelli...
Hasan Davulcu, Michael Kifer, I. V. Ramakrishnan