27 search results - page 3 / 6 » New Constraints on Generation of Uniform Random Samples from... |
SAC
2003
ACM
13 years 10 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
AAAI
2008
13 years 7 months ago
2008
We introduce novel algorithms for generating random solutions from a uniform distribution over the solutions of a boolean satisfiability problem. Our algorithms operate in two pha...
TOG
2008
13 years 4 months ago
2008
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
TOG
2002
13 years 4 months ago
2002
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...