Sciweavers

10890 search results - page 83 / 2178
» Automatic Complexity Analysis
Sort
View
123
Voted
BMCBI
2008
123views more  BMCBI 2008»
15 years 22 days ago
Statistical methodology for the analysis of dye-switch microarray experiments
Background: In individually dye-balanced microarray designs, each biological sample is hybridized on two different slides, once with Cy3 and once with Cy5. While this strategy ens...
Tristan Mary-Huard, Julie Aubert, Nadera Mansouri-...
121
Voted
WCET
2003
15 years 2 months ago
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
Björn Lisper
AND
2010
14 years 10 months ago
Reshaping automatic speech transcripts for robust high-level spoken document analysis
High-level spoken document analysis is required in many applications seeking access to the semantic content of audio data, such as information retrieval, machine translation or au...
Julien Fayolle, Fabienne Moreau, Christian Raymond...
103
Voted
LCTRTS
1998
Springer
15 years 4 months ago
Automatic Accurate Time-Bound Analysis for High-Level Languages
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence ...
Yanhong A. Liu, Gustavo Gomez
ICIP
2004
IEEE
16 years 2 months ago
Performance analysis of an improved tensor based correspondence algorithm for automatic 3d modeling
3D modeling of a free-form object involves the acquisition of multiple views (range images) of the object to cover its entire surface. These views are then registered in a common ...
Ajmal S. Mian, Mohammed Bennamoun, Robyn A. Owens