29908 search results - page 354 / 5982 » On the Complexity of |
153
Voted
JSSPP
2005
Springer
16 years 9 days ago
2005
Springer
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
177
click to vote
PCM
2005
Springer
16 years 9 days ago
2005
Springer
In this paper we propose a robust text segmentation method in complex background. The proposed method first utilizes the K-means algorithm to decompose a detected text block into ...
157
click to vote
WCC
2005
Springer
16 years 8 days ago
2005
Springer
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are abl...
192
click to vote
NPAR
2004
ACM
16 years 7 days ago
2004
ACM
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
192
click to vote
ACRI
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. This paper reviews the history of embedded, evolvable selfreplicating structures implemented as cellular automata systems. We relate recent advances in this field to the...