Sciweavers

2446 search results - page 247 / 490
» Polyadic Concept Analysis
Sort
View
148
Voted
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
15 years 5 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
CGF
2008
81views more  CGF 2008»
15 years 5 months ago
Lagrangian Visualization of Flow-Embedded Surface Structures
The powerful yet conceptually simple notions of Finite-Time Lyapunov Exponent (FTLE) and Lagrangian Coherent Structures provide a powerful framework for the analysis and visualiza...
Christoph Garth, Alexander Wiebel, Xavier Tricoche...
144
Voted
JSW
2008
130views more  JSW 2008»
15 years 5 months ago
A Constraint-Driven Executable Model of Dynamic System Reconfiguration
Dynamic system reconfiguration techniques are presented that can enable the systematic evolution of software systems due to unanticipated changes in specification or requirements. ...
D'Arcy Walsh, Francis Bordeleau, Bran Selic
JCB
2002
93views more  JCB 2002»
15 years 4 months ago
Unfolding of Microarray Data
The use of DNA microarrays for the analysis of complex biological samples is becoming a mainstream part of biomedical research. One of the most commonly used methods compares the ...
Andrew B. Goryachev, Pascale F. Macgregor, Aled M....
ISOLA
2010
Springer
15 years 3 months ago
A Linked Data Approach to Sharing Workflows and Workflow Results
A bioinformatics analysis pipeline is often highly elaborate, due to the inherent complexity of biological systems and the variety and size of laboratory publications would be high...
Marco Roos, Sean Bechhofer, Jun Zhao, Paolo Missie...