17582 search results - page 3445 / 3517 » From Distributed Sequential Computing to Distributed Paralle... |
138
click to vote
VLDB
2004
ACM
15 years 7 months ago
2004
ACM
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
135
Voted
SIGIR
2003
ACM
15 years 7 months ago
2003
ACM
Libraries have traditionally used manual image annotation for indexing and then later retrieving their image collections. However, manual image annotation is an expensive and labo...
121
click to vote
ISCA
2000
IEEE
15 years 6 months ago
2000
IEEE
Communication in cache-coherent distributed shared memory (DSM) often requires invalidating (or writing back) cached copies of a memory block, incurring high overheads. This paper...
141
click to vote
KDD
2010
ACM
15 years 6 months ago
2010
ACM
Classification is one of the most essential tasks in data mining. Unlike other methods, associative classification tries to find all the frequent patterns existing in the input...
110
click to vote
ICECCS
1995
IEEE
15 years 5 months ago
1995
IEEE
When trying to describe the behaviour of large systems, such as the business processes of large enterprises, we often adopt diagramming techniques based on derivatives of data flo...