161 search results - page 15 / 33 » Counting Distinct Strings |
CVPR
2003
IEEE
14 years 10 months ago
2003
IEEE
We describe a tracker that can track moving people in long sequences without manual initialization. Moving people are modeled with the assumption that, while configuration can var...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
ICMCS
2007
IEEE
14 years 13 days ago
2007
IEEE
In this work, we investigate the routing problems ofminimizing the number ofdistinct transmission mediums or carrier domains for multimedia communications. We consider the problem...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
FUN
2010
Springer
14 years 1 months ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...