84 search results - page 12 / 17 » Asymptotic enumeration of orientations |
RSS
2007
15 years 19 days ago
2007
— In this paper a new leader-follower formation of nonholonomic mobile robots is studied. The follower is a car-like vehicle and the leader is a tractor pulling a trailer. The le...
COMBINATORICA
2010
14 years 8 months ago
2010
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimens...
111
click to vote
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
COMBINATORICS
2004
14 years 11 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...