276 search results - page 9 / 56 » The Complexity of Computing Maximal Word Functions |
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
107
click to vote
APCSAC
2004
IEEE
15 years 1 months ago
2004
IEEE
We examine secure computing paradigms to identify any new architectural challenges for future general-purpose processors. Some essential security functions can be provided by diffe...
AML
1998
14 years 9 months ago
1998
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
DAM
2011
14 years 4 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
95
Voted
EWCBR
2004
Springer
15 years 2 months ago
2004
Springer
The complexity of software systems makes design reuse a necessary task in the software development process. CASE tools can provide cognitive assistance in this task, helping the so...