213 search results - page 20 / 43 » An Approximation Algorithm for Binary Searching in Trees |
BMCBI
2010
13 years 7 months ago
2010
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...
AI
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
WWW
2011
ACM
13 years 2 months ago
2011
ACM
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
CPC
1999
13 years 7 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...