2127 search results - page 5 / 426 » Computing large matchings fast |
KDD
2007
ACM
14 years 7 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
CVIU
2011
13 years 2 months ago
2011
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification m...
KDD
1998
ACM
13 years 11 months ago
1998
ACM
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
PPAM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...