273 search results - page 33 / 55 » Improving the Efficiency of Memory Partitioning by Address C... |
104
click to vote
PKDD
2010
Springer
14 years 9 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
123
click to vote
ICPP
1999
IEEE
15 years 4 months ago
1999
IEEE
The probability of failures in software distributed shared memory (SDSM) increases as the system size grows. This paper introduces a new, efficient message logging technique, call...
ICS
1999
Tsinghua U.
15 years 4 months ago
1999
Tsinghua U.
This paper proposes a novel way to use virtual memorymapped communication (VMMC) to reduce the failover time on clusters. With the VMMC model, applications’ virtual address spac...
ISCA
2003
IEEE
15 years 5 months ago
2003
IEEE
Despite their superior performance for multimedia applications, vector processors have three limitations that hinder their widespread acceptance. First, the complexity and size of...
111
click to vote
ICML
2003
IEEE
15 years 5 months ago
2003
IEEE
Feature selection methods have been successfully applied to text categorization but seldom applied to text clustering due to the unavailability of class label information. In this...