114 search results - page 3 / 23 » The Tree Inclusion Problem: In Linear Space and Faster |
CCCG
2003
13 years 6 months ago
2003
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...
ICML
2009
IEEE
14 years 6 months ago
2009
IEEE
We show how variational Bayesian inference can be implemented for very large generalized linear models. Our relaxation is proven to be a convex problem for any log-concave model. ...
OPODIS
2001
13 years 6 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
IPL
2010
13 years 3 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
DGCI
2009
Springer
13 years 8 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...