Sciweavers

11345 search results - page 1723 / 2269
» Foundations of Computer Science
Sort
View
HYBRID
2010
Springer
15 years 8 months ago
Identifiability of discrete-time linear switched systems
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the...
Mihály Petreczky, Laurent Bako, Jan H. van ...
CSCLP
2008
Springer
15 years 8 months ago
Solving CSPs with Naming Games
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
Stefano Bistarelli, Giorgio Gosti
CSL
2008
Springer
15 years 8 months ago
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
Ian Hodkinson, Angelo Montanari, Guido Sciavicco
157
Voted
ETRA
2008
ACM
149views Biometrics» more  ETRA 2008»
15 years 8 months ago
The incomplete fixation measure
In this paper we evaluate several of the most popular algorithms for segmenting fixations from saccades by testing these algorithms on the scanning patterns of toddlers. We show t...
Frederick Shic, Brian Scassellati, Katarzyna Chawa...
ETRA
2008
ACM
119views Biometrics» more  ETRA 2008»
15 years 8 months ago
A software framework for simulating eye trackers
We describe an open-source software framework that simulates the measurements made using one or several cameras in a videooculographic eye tracker. The framework can be used to co...
Martin Böhme, Michael Dorr, Mathis Graw, Thom...
« Prev « First page 1723 / 2269 Last » Next »