60 search results - page 11 / 12 » On Binary Searching with Nonuniform Costs |
CPC
1999
13 years 4 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...
ALGORITHMICA
2005
13 years 4 months ago
2005
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
COMPSAC
2008
IEEE
13 years 11 months ago
2008
IEEE
The rapid growth of Internet population leads to the shortage of IP addresses. The next generation IP protocol, IPv6, which extends the IP address length from 32 bits to 128 bits,...
GLOBECOM
2006
IEEE
13 years 10 months ago
2006
IEEE
— In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that t...
PKDD
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Pattern-based classification has demonstrated its power in recent studies, but because the cost of mining discriminative patterns as features in classification is very ex...