4137 search results - page 134 / 828 » On the number of matchings of a tree |
131
click to vote
TARK
1998
Springer
15 years 10 months ago
1998
Springer
We look at the Big Match game, a variation of the repeated Matching Pennies game where if the rst player plays tails the game ends with the rst player receiving the last round...
190
click to vote
FCCM
2009
IEEE
15 years 4 months ago
2009
IEEE
We propose a pipelined field-merge architecture for memory-efficient and high-throughput large-scale string matching (LSSM). Our proposed architecture partitions the (8-bit) charac...
162
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We introduce a new structural constraint that can be used for matching points in image pairs taken from a wide baseline. No assumption is made about the geometry of the 3?D points...
154
click to vote
ICCSA
2010
Springer
16 years 1 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
183
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...