Sciweavers

4041 search results - page 351 / 809
» time 2009
Sort
View
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
15 years 4 months ago
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
Donatello Materassi, Giacomo Innocenti, Laura Giar...
COMAD
2009
15 years 4 months ago
Similarity Search in Moving Object Trajectories
The continuous and rapid advent in mobile and communications technology opens the way for new research areas and new applications. Moving Object Databases(MODs) are among the emer...
Omnia Ossama Hoda, M. O. Mokhtar
CORR
2009
Springer
115views Education» more  CORR 2009»
15 years 4 months ago
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
Marco Almeida, Nelma Moreira, Rogério Reis
CPM
2009
Springer
183views Combinatorics» more  CPM 2009»
15 years 4 months ago
Permuted Longest-Common-Prefix Array
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
Juha Kärkkäinen, Giovanni Manzini, Simon...
CSEE
2009
Springer
15 years 4 months ago
A Requirements Engineering and Management Training Course for Software Development Professionals
Devising a course for software professionals working in industry depends on several factors. In order to create a course that fulfils professionals' expectations, it is impor...
João M. Fernandes, Ricardo Jorge Machado, S...