656 search results - page 16 / 132 » Minimal non-convex words |
MOR
2000
14 years 9 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
TCS
2008
14 years 9 months ago
2008
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that t...
TAMC
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...
70
Voted
GLVLSI
2009
IEEE
15 years 4 months ago
2009
IEEE
Implementing a custom hardware is not always feasible due to cost and time considerations. No instruction set computer (NISC) architecture is one of the promising direction to des...
GRAPHICSINTERFACE
2003
14 years 11 months ago
2003
Surface pasting is a hierarchical modeling technique capable of adding local details to tensor product Bspline surfaces without incurring significant computational costs. In this...