4137 search results - page 117 / 828 » On the number of matchings of a tree |
158
click to vote
ICMCS
2005
IEEE
16 years 2 days ago
2005
IEEE
We propose a quad-tree scheme for obtaining sub-pixel estimates of interframe motion in the frequency domain. Our scheme is based on phase correlation and uses motion compensated ...
207
click to vote
WIA
2007
Springer
16 years 17 days ago
2007
Springer
The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important a...
192
click to vote
FOCS
2008
IEEE
16 years 28 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
205
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
158
click to vote
4OR
2010
15 years 6 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...