14548 search results - page 2465 / 2910 » The Optimal Path-Matching Problem |
192
click to vote
ALT
2007
Springer
16 years 1 months ago
2007
Springer
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
171
Voted
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
209
Voted
ISVC
2007
Springer
16 years 1 months ago
2007
Springer
We present a novel boosting algorithm where temporal consistency is addressed in a short-term way. Although temporal correlation of observed data may be an important cue for classi...
252
click to vote
SSD
2007
Springer
16 years 29 days ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
219
Voted
VLDB
2007
ACM
16 years 29 days ago
2007
ACM
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...