393 search results - page 1 / 79 » The LCA Problem Revisited |
LATIN
2000
Springer
13 years 9 months ago
2000
Springer
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable...
ECCC
2006
13 years 5 months ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
CPM
2006
Springer
13 years 9 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
SADM
2010
13 years 2 days ago
2010
: The traditional latent class analysis (LCA) uses a mixture model with binary responses on each subject that are independent conditional on cluster membership. However, in many pr...
WWW
2010
ACM
14 years 5 days ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...