33 search results - page 4 / 7 » On Minimal Words With Given Subword Complexity |
MP
2010
13 years 3 months ago
2010
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
ECCC
2006
13 years 8 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
DM
2008
13 years 8 months ago
2008
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional array with ...
ADHOCNOW
2008
Springer
14 years 2 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
CG
2006
Springer
13 years 8 months ago
2006
Springer
This paper presents an energy-based approach that models the distinct wrinkle shapes to represent the different material properties of non-rigid objects at an interactive speed. O...