4797 search results - page 49 / 960 » The complexity of partition tasks |
ICPP
1998
IEEE
14 years 1 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
PDCAT
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This paper proposes a simplified simultaneous multithreading (SMT) architecture aiming at CPU cores of embedded SoCs for consumer applications. This architecture reduces...
ICIP
2001
IEEE
14 years 10 months ago
2001
IEEE
This paper presents a new technique based on anisotropic diffusion for segmenting color images. This operation is accomplished through two independent anisotropic diffusion proces...
EMNLP
2007
13 years 10 months ago
2007
This paper discusses automatic determination of case in Arabic. This task is an important part and major source of errors in full diacritization of Arabic. We use a goldstandard s...
ISAAC
2003
Springer
14 years 2 months ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...