1060 search results - page 63 / 212 » On the Discovery of Random Trees |
AHSWN
2008
14 years 10 months ago
2008
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
CVPR
2006
IEEE
16 years 3 days ago
2006
IEEE
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
IROS
2006
IEEE
15 years 4 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
PQCRYPTO
2010
15 years 2 months ago
2010
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
AAAI
2011
13 years 10 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...