185 search results - page 17 / 37 » Solving problems on recursively constructed graphs |
SIAMNUM
2010
14 years 6 months ago
2010
The quantization based filtering method (see [13], [14]) is a grid based approximation method to solve nonlinear filtering problems with discrete time observations. It relies on o...
FOSSACS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
CAI
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
100
click to vote
ICASSP
2010
IEEE
14 years 12 months ago
2010
IEEE
We study the problem of event detection from realistic videos with repetitive sequential human activities. Despite the large body of work on event detection and recognition, very ...
ICPR
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper, we propose a novel multi-class graph boosting algorithm to recognize different visual objects. The proposed method treats subgraph as feature to construct base clas...