Sciweavers

672 search results - page 3 / 135
» Words and forbidden factors
Sort
View
JCSS
2010
155views more  JCSS 2010»
13 years 5 months ago
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization ...
Michael Dom, Jiong Guo, Rolf Niedermeier
DAM
1999
99views more  DAM 1999»
13 years 7 months ago
Recognizing Graphs of Acyclic Cubical Complexes
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...
Wilfried Imrich, Sandi Klavzar
ICRA
2007
IEEE
160views Robotics» more  ICRA 2007»
14 years 1 months ago
Virtual Fixture Control for Compliant Human-Machine Interfaces
— In human-machine collaborative systems, robot joint compliance and human-input dynamics lead to involuntary tool motion into undesired regions. To correct this, a set of method...
Panadda Marayong, Hye Sun Na, Allison M. Okamura
COCOON
2006
Springer
13 years 11 months ago
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
Min Chih Lin, Jayme Luiz Szwarcfiter
ITA
2002
13 years 7 months ago
Density of Critical Factorizations
Abstract. We investigate the density of critical factorizations of infinte sequences of words. The density of critical factorizations of a word is the ratio between the number of p...
Tero Harju, Dirk Nowotka