25 search results - page 4 / 5 » Optimal finger search trees in the pointer machine |
ALENEX
2001
13 years 7 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
GECCO
2007
Springer
14 years 12 days ago
2007
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
NIPS
2007
13 years 7 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
ICTAI
2008
IEEE
14 years 20 days ago
2008
IEEE
Unlike simple questions, complex questions cannot be answered by simply extracting named entities. These questions require inferencing and synthesizing information from multiple d...
EMSOFT
2005
Springer
13 years 11 months ago
2005
Springer
Early applications of smart cards have focused in the area of personal security. Recently, there has been an increasing demand for networked, multi-application cards. In this new ...