1421 search results - page 101 / 285 » Algorithms for subsequence combinatorics |
144
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
132
click to vote
MP
1998
15 years 4 months ago
1998
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
162
click to vote
ICIP
2001
IEEE
16 years 6 months ago
2001
IEEE
In standard predictive video coders, intra-mode coding of macroblocks (MBs) provides packet loss resilience, at the cost of reduced compression efficiency. Conventional mode selec...
235
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
145
click to vote
MMM
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we propose a new algorithm to find video clips with different temporal durations and some spatial variations. We adopt a longest common subsequence (LCS) matching t...