Sciweavers

1199 search results - page 162 / 240
» Robust inference of trees
Sort
View
ICTAC
2004
Springer
14 years 2 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
BMCBI
2006
128views more  BMCBI 2006»
13 years 9 months ago
An interactive tool for visualization of relationships between gene expression profiles
Background: Application of phenetic methods to gene expression analysis proved to be a successful approach. Visualizing the results in a 3-dimentional space may further enhance th...
Peter Ruzanov, Steven J. M. Jones
MICS
2010
81views more  MICS 2010»
13 years 7 months ago
Tactics for Hierarchical Proof
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
David Aspinall, Ewen Denney, Christoph Lüth
BMCBI
2007
119views more  BMCBI 2007»
13 years 9 months ago
A dynamic programming approach for the alignment of signal peaks in multiple gas chromatography-mass spectrometry experiments
Background: Gas chromatography-mass spectrometry (GC-MS) is a robust platform for the profiling of certain classes of small molecules in biological samples. When multiple samples ...
Mark D. Robinson, David P. De Souza, Woon Wai Keen...
COMCOM
2006
95views more  COMCOM 2006»
13 years 9 months ago
E-Span and LPT for data aggregation in wireless sensor networks
In wireless sensor networks (WSNs), when a stimulus or event is detected within a particular region, data reports from the neighboring sensor nodes (sources) are sent to the sink ...
Weinan Marc Lee, Vincent W. S. Wong