6542 search results - page 153 / 1309 » The tao of parallelism in algorithms |
192
click to vote
ECCV
2008
Springer
15 years 7 months ago
2008
Springer
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...
165
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
We have designed a functional data-parallel language called BSML for programming bulk-synchronous parallel (BSP) algorithms. The execution time can be estimated and dead-locks and ...
197
click to vote
CPM
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
174
click to vote
RTSS
1999
IEEE
15 years 10 months ago
1999
IEEE
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
157
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...