3510 search results - page 304 / 702 » Searching with numbers |
166
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
188
Voted
FSTTCS
2000
Springer
15 years 10 months ago
2000
Springer
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
202
click to vote
BDA
2007
15 years 8 months ago
2007
Schema matching is a crucial task to gather information of the same domain. This is more true on the web, where a large number of data sources are available and require to be matc...
161
click to vote
MM
2010
ACM
15 years 7 months ago
2010
ACM
Discovering common objects that appear frequently in a number of images is a challenging problem, due to (1) the appearance variations of the same common object and (2) the enormo...
169
Voted
MCS
2006
Springer
15 years 6 months ago
2006
Springer
We investigate the amount of cooperation between agents in a population during reward collection that is required to minimize the overall collection time. In our computer simulati...