132 search results - page 24 / 27 » A Linear Size Index for Approximate Pattern Matching |
ICB
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Most of gait recognition algorithms involve walking cycle estimation to accomplish signature matching. However, we may be plagued by two cycle-related issues when develop...
CCCG
2008
13 years 8 months ago
2008
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
JCO
2006
13 years 7 months ago
2006
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
IIS
2003
13 years 8 months ago
2003
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
4OR
2010
13 years 7 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...