285 search results - page 40 / 57 » New Ways to Construct Binary Search Trees |
191
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
We are witnessing in recent years growing interest for location-dependent information services among mobile users. This paper examines the issue of processing locationdependent qu...
ECML
2006
Springer
15 years 3 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...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
143
click to vote
ADBIS
2007
Springer
15 years 3 months ago
2007
Springer
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
100
click to vote
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...