Sciweavers

84 search results - page 12 / 17
» Asymptotic enumeration of orientations
Sort
View
RSS
2007
154views Robotics» more  RSS 2007»
13 years 9 months ago
Sliding mode formation tracking control of a tractor and trailer-car system
— 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...
Fabio Morbidi, Domenico Prattichizzo
COMBINATORICA
2010
13 years 5 months ago
Formulae and growth rates of high-dimensional polycubes
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...
Ronnie Barequet, Gill Barequet, Günter Rote
STACS
2010
Springer
14 years 2 months ago
Planar Subgraph Isomorphism Revisited
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...
Frederic Dorn
CORR
2006
Springer
96views Education» more  CORR 2006»
13 years 8 months ago
Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure Channels
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...
Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Po...
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
13 years 7 months ago
Strings with Maximally Many Distinct Subsequences and Substrings
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...
Abraham Flaxman, Aram Wettroth Harrow, Gregory B. ...