Sciweavers

4212 search results - page 62 / 843
» On Compressible Pairings and Their Computation
Sort
View
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
15 years 6 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
CG
2011
Springer
14 years 7 months ago
Multiresolutions numerically from subdivisions
In previous work we introduced a construction to produce multiresolutions from given subdivisions. A portion of that construction required solving bilinear equations using a symbo...
Richard H. Bartels, Faramarz Samavati
110
Voted
ICCV
2011
IEEE
14 years 18 days ago
Local Intensity Order Pattern for Feature Description
This paper presents a novel method for feature description based on intensity order. Specifically, a Local Intensity Order Pattern(LIOP) is proposed to encode the local ordinal i...
Zhenhua Wang, Bin Fan, Fuchao Wu
112
Voted
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
15 years 5 months ago
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda...
144
Voted
ECCV
2008
Springer
16 years 5 months ago
Co-Recognition of Image Pairs by Data-Driven Monte Carlo Image Exploration
We introduce a new concept of co-recognition for object-level image matching between an arbitrary image pair. Our method augments putative local regionmatches to reliable object-...
Minsu Cho (Seoul National University), Young Min S...