312 search results - page 44 / 63 » An experimental study on algorithms for drawing binary trees |
SBACPAD
2007
IEEE
14 years 1 months ago
2007
IEEE
We present node level primitives for parallel exact inference on an arbitrary Bayesian network. We explore the probability representation on each node of Bayesian networks and eac...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
In this paper, we study the problem of fine-grained image categorization. The goal of our method is to explore fine image statistics and identify the discriminative image patche...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
CIKM
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately and ...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
The mean is often the most important statistic of a dataset as it provides a single point that summarizes the entire set. While the mean is readily defined and computed in Euclid...