1007 search results - page 50 / 202 » An approach for matching communication patterns in parallel ... |
115
Voted
VRML
2003
ACM
15 years 6 months ago
2003
ACM
Embodied agents or humanoid avatars may effectively be used to communicate with human users. Currently there is a wide range of specification formalisms and scripting languages f...
122
click to vote
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A...
107
Voted
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
118
click to vote
PKDD
2004
Springer
15 years 7 months ago
2004
Springer
Abstract In this paper we propose a novel parallel algorithm for frequent itemset mining. The algorithm is based on the filter-stream programming model, in which the frequent item...