2244 search results - page 240 / 449 » A new heuristic approach for non-convex optimization problem... |
202
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
The existing methods for offline training of cascade classifiers take a greedy search to optimize individual classifiers in the cascade, leading inefficient overall performance. W...
215
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Recommender systems perform much better on users for which they have more information. This gives rise to a problem of satisfying users new to a system. The problem is even more a...
209
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
Hidden Markov Models (HMMs) are an useful and widely utilized approach to the modeling of data sequences. One of the problems related to this technique is finding the optimal stru...
213
click to vote
AIPS
2007
15 years 9 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
279
click to vote
AAAI
2010
15 years 8 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...