Sciweavers

3641 search results - page 208 / 729
» On Computability of Pattern Recognition Problems
Sort
View
TKDE
2008
128views more  TKDE 2008»
15 years 7 months ago
Mixed-Drove Spatiotemporal Co-Occurrence Pattern Mining
Mixed-drove spatiotemporal co-occurrence patterns (MDCOPs) represent subsets of two or more different object-types whose instances are often located in spatial and temporal proximi...
Mete Celik, Shashi Shekhar, James P. Rogers, James...
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
16 years 1 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
IPPS
1999
IEEE
15 years 11 months ago
Dynamic Process Composition and Communication Patterns in Irregularly Structured Applications
In this paper we describe one experiment in which a new coordination language, called MANIFOLD, is used to restructure an existing sequential Fortran code from computational uid dy...
C. T. H. Everaars, Barry Koren, Farhad Arbab
ICPR
2006
IEEE
16 years 1 months ago
Fast Feature Extraction Approach for Multi-Dimension Feature Space Problems
Recently, we proposed a fast feature extraction approach denoted FSOM utilizes Self Organizing Map (SOM). FSOM [1] overcomes the slowness of traditional SOM search algorithm. We i...
Alaa El. Sagheer, Naoyuki Tsuruta, Rin-ichiro Tani...
COMPUTE
2010
ACM
15 years 11 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy