1081 search results - page 11 / 217 » Working with the LR Degrees |
92
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
Kernelizing partial least squares (PLS), an algorithm which has been particularly popular in chemometrics, leads to kernel PLS which has several interesting properties, including ...
123
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
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...
107
Voted
ISCC
2005
IEEE
15 years 6 months ago
2005
IEEE
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...
83
Voted
WG
2004
Springer
15 years 6 months ago
2004
Springer
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...
91
Voted
ALGORITHMICA
2005
15 years 18 days ago
2005
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...