Sciweavers

3179 search results - page 176 / 636
» Applications of PCF Theory
Sort
View
GBRPR
2005
Springer
14 years 3 months ago
Hypergraph-Based Image Representation
Abstract. An appropriate image representation induces some good image treatment algorithms. Hypergraph theory is a theory of finite combinatorial sets, modeling a lot of problems ...
Alain Bretto, Luc Gillibert
DATE
2000
IEEE
83views Hardware» more  DATE 2000»
14 years 2 months ago
Wave Steered FSMs
In this paper we address the problem of designing very high throughput finite state machines (FSMs). The presence of loops in sequential circuits prevents a straightforward and g...
Luca Macchiarulo, Shih-Ming Shu, Malgorzata Marek-...
ATAL
1999
Springer
14 years 2 months ago
Reactivity in a Logic-Based Robot Programming Framework
A robot must often react to events in its environment and exceptional conditions by suspendingor abandoning its current plan and selecting a new plan that is an appropriate respons...
Yves Lespérance, Kenneth Tam, Michael R. M....
DFG
2007
Springer
14 years 2 months ago
Why Interval Arithmetic is so Useful
: Interval arithmetic was introduced by Ramon Moore [Moo66] in the 1960s as an approach to bound rounding errors in mathematical computation. The theory of interval analysis emerge...
Younis Hijazi, Hans Hagen, Charles D. Hansen, Kenn...
HYBRID
2010
Springer
14 years 6 days 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 ...