4085 search results - page 810 / 817 » Benchmarking Data Mining Algorithms |
FCCM
2000
IEEE
14 years 11 hour ago
2000
IEEE
Simplifying the programming models is paramount to the success of reconfigurable computing. We apply the principles of object-oriented programming to the design of stream archite...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
ISPD
2000
ACM
13 years 12 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
IJCAI
2007
13 years 9 months ago
2007
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task ...
PDCN
2004
13 years 9 months ago
2004
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...