Sciweavers

7380 search results - page 81 / 1476
» time 2008
Sort
View
SIGACT
1998
105views more  SIGACT 1998»
15 years 5 months ago
Everything you wanted to know about the running time of Mergesort but were afraid to ask
Although mergesort is an algorithm that is frequently glossed over in textbooks, it provides fertile ground for planting ideas about algorithm analysis in the minds of students. A...
Ian Parberry
TMI
2002
88views more  TMI 2002»
15 years 5 months ago
What is the best similarity measure for motion correction in fMRI time series?
It has been shown that the difference of squares cost function used by standard realignment packages (SPM and AIR) can lead to the detection of spurious activations, because the mo...
Luis Freire, Alexis Roche, Jean-Francois Mangin
ENGL
2008
133views more  ENGL 2008»
15 years 6 months ago
Cycle Time Forecasting Models for Defect Inspection Process in TFT-LCD Module Assembly
Because most of the procedures in defect inspection process of TFT-LCD module assembly are examined manually through human vision, cycle time estimation for this particular process...
Chien-wen Shen
ENTCS
2008
68views more  ENTCS 2008»
15 years 6 months ago
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
This paper introduces a new algorithm dedicated to the rigorous reachability analysis of nonlinear dynamical systems. The algorithm is initially presented in the context of discre...
Pieter Collins, Alexandre Goldsztejn
FUIN
2008
89views more  FUIN 2008»
15 years 6 months ago
Is Timed Branching Bisimilarity a Congruence Indeed?
We show that timed branching bisimilarity as defined by Van der Zwaag [16] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose ...
Wan Fokkink, Jun Pang, Anton Wijs