60 search results - page 6 / 12 » On Binary Searching with Nonuniform Costs |
ECML
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we propose a new method for learning to rank. `Ranking SVM' is a method for performing the task. It formulizes the problem as that of binary classific...
AAAI
2012
11 years 10 months ago
2012
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
VIS
2003
IEEE
14 years 9 months ago
2003
IEEE
In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to iden...
IPM
2006
13 years 7 months ago
2006
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....