62 search results - page 4 / 13 » On the Expressiveness and Complexity of Randomization in Fin... |
WIA
2004
Springer
14 years 21 days ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Traditional content based publish/subscribe (pub/sub) systems allow users to express stateless subscriptions evaluated on individual events. However, many applications such as moni...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Reliable facial expression recognition by machine is still a challenging task. We propose a framework to recognise various expressions by tracking facial features. Our method uses...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
This paper presents a random finite set theoretic formulation for multi-object tracking as perceived by a 3D-LIDAR in a dynamic environment. It is mainly concerned with the joint...
CEC
2003
IEEE
14 years 20 days ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...