81 search results - page 9 / 17 » Properties of Random Triangulations and Trees |
156
click to vote
COMBINATORICA
2007
15 years 5 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
167
Voted
DAC
1989
ACM
15 years 9 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
166
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract— This paper presents a randomized manipulation planner for a multi-fingered hand by switching contact modes. Manipulation planning for such a system should consider cha...
156
click to vote
GECCO
2007
Springer
15 years 12 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
149
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...