Kernelizing partial least squares (PLS), an algorithm which has been particularly popular in chemometrics, leads to kernel PLS which has several interesting properties, including ...
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vi...
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
David Benoit, Erik D. Demaine, J. Ian Munro, Rajee...