16430 search results - page 346 / 3286 » On Computable Tree Functions |
129
Voted
IJCV
2007
15 years 5 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
238
click to vote
TCIAIG
2010
14 years 11 months ago
2010
Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of artificial intelligence research since Claude Shannon's ...
177
Voted
SAC
2011
ACM
14 years 7 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
141
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
A prototype-based approach is introduced for action
recognition. The approach represents an action as a se-
quence of prototypes for efficient and flexible action match-
ing in ...
139
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
The bag-of-visual-words (BOVW) approaches are widely used in human action recognition. Usually, large vocabulary size of the BOVW is more discriminative for inter-class action clas...