4797 search results - page 266 / 960 » The complexity of partition tasks |
206
click to vote
ERCIMDL
2000
Springer
15 years 10 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
158
click to vote
FLAIRS
2007
15 years 9 months ago
2007
In this paper, we focus on the ontological concept extraction and evaluation process from HTML documents. In order to improve this process, we propose an unsupervised hierarchical...
190
click to vote
CIC
2003
15 years 8 months ago
2003
Using off-the-shelf commodity workstations to build a cluster for parallel computing has become a common practice. In studying or designing a cluster of workstations one should ha...
169
click to vote
JUCS
2008
15 years 6 months ago
2008
Abstract: The thematic text segmentation task consists in identifying the most important thematic breaks in a document in order to cut it into homogeneous passages. We propose in t...
182
click to vote
JCM
2007
15 years 6 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...