874 search results - page 44 / 175 » Faster Algorithms for Semi-Matching Problems |
SSPR
2010
Springer
13 years 6 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
BDA
2000
13 years 9 months ago
2000
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new a...
CPM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
JCO
2000
13 years 7 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
ICASSP
2007
IEEE
13 years 11 months ago
2007
IEEE
We propose an algorithm to detect depths in a light field. Specifically, given a 4D light field, we find all planes at which objects are located. Although the exact depth of each ...