4983 search results - page 910 / 997 » order 2008 |
CN
1999
13 years 8 months ago
1999
Traditional image compression techniques seek the smallest possible le size for a given level of image quality. By contrast, network-conscious image compression techniques take in...
CPC
1999
13 years 8 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...
DATAMINE
1999
13 years 8 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
SIAMCOMP
1998
13 years 8 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
TCAD
1998
13 years 8 months ago
1998
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...