8 search results - page 2 / 2 » Optimal Binary Search Trees with Costs Depending on the Acce... |
SIAMCOMP
2002
13 years 4 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
— For many wireless communication links, such as those employing turbo codes or sequentially-decoded convolutional codes, the power consumption of the decoder at the receiver dep...
HPDC
2005
IEEE
13 years 10 months ago
2005
IEEE
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...