569 search results - page 77 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
136
click to vote
KI
2010
Springer
15 years 6 days ago
2010
Springer
Recognizing human intentions is part of the decision process in many technical devices. In order to achieve natural interaction, the required estimation quality and the used comput...
118
click to vote
LATIN
1998
Springer
15 years 6 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
174
click to vote
JMLR
2010
14 years 9 months ago
2010
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
136
Voted
ISAAC
2010
Springer
15 years 6 days ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
152
Voted
ICIP
2006
IEEE
16 years 4 months ago
2006
IEEE
In this study, an algorithm is proposed to solve the multi-frame structure from motion (MFSfM) problem for monocular video sequences in dynamic scenes. The algorithm uses the epip...