Sciweavers

338 search results - page 23 / 68
» Using pattern matching for tiling and packing problems
Sort
View
PETRA
2009
ACM
15 years 4 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
ECCV
2002
Springer
15 years 11 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
CEC
2007
IEEE
15 years 4 months ago
A histogram-matching approach to the evolution of bin-packing strategies
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
Riccardo Poli, John Woodward, Edmund K. Burke
77
Voted
CIBCB
2008
IEEE
15 years 4 months ago
An information theoretic approach for the discovery of irregular and repetitive patterns in genomic data
sequence content at an abstract level and offers novel ways to examine the information contained in them. Our approach is an information theoretic search process which uses patter...
Willard Davis, Ananth Kalyanaraman, Diane J. Cook
PR
2007
134views more  PR 2007»
14 years 9 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...