1012 search results - page 138 / 203 » Segment intersection searching problems in general settings |
ICML
2005
IEEE
16 years 19 days ago
2005
IEEE
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term ...
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
SIGIR
2005
ACM
15 years 5 months ago
2005
ACM
When applying blind relevance feedback for ad hoc document retrieval, is it possible to identify, a priori, the set of query terms that will most improve retrieval performance? Ca...
IEAAIE
2004
Springer
15 years 5 months ago
2004
Springer
This paper proposes extending semi-supervised learning by allowing an ongoing interaction between a user and the system. The extension is intended to not only to speed up search fo...
WABI
2001
Springer
15 years 4 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...