1461 search results - page 137 / 293 » The Cost of Cache-Oblivious Searching |
157
click to vote
ICIP
2007
IEEE
16 years 23 days ago
2007
IEEE
Block based motion compensation techniques make frequent use of Early Termination Algorithms (ETA) to reduce the computational cost of block matching process. ETAs have been well ...
176
click to vote
CIKM
2004
Springer
15 years 12 months ago
2004
Springer
Peer-to-peer Data Networks (PDNs) are large-scale, selforganizing, distributed query processing systems. Familiar examples of PDN are peer-to-peer file-sharing networks, which su...
181
click to vote
CPC
1999
15 years 6 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...
149
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we consider the problem of identifying and segmenting topically cohesive regions in the URL tree of a large website. Each page of the website is assumed to have a t...
153
click to vote
ICDM
2006
IEEE
16 years 15 days ago
2006
IEEE
Classification of data with imbalanced class distribution has posed a significant drawback of the performance attainable by most standard classifier learning algorithms, which ...