9595 search results - page 1626 / 1919 » Functional programming in C |
194
click to vote
DM
2000
15 years 6 months ago
2000
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...
178
click to vote
JAL
2002
15 years 6 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
186
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...
174
click to vote
MST
2002
15 years 6 months ago
2002
The poor scalability of existing superscalar processors has been of great concern to the computer engineering community. In particular, the critical-path lengths of many components...
186
click to vote
NECO
1998
15 years 6 months ago
1998
We describe a new method for performing a nonlinear form of Principal Component Analysis. By the use of integral operator kernel functions, we can e ciently compute principal comp...