3068 search results - page 300 / 614 » Clustering with Multiple Graphs |
215
click to vote
ICAC
2005
IEEE
16 years 9 days ago
2005
IEEE
This paper introduces a self-configuring architecture for scaling the database tier of dynamic content web servers. We use a unified approach to load and fault management based ...
170
click to vote
CCGRID
2003
IEEE
16 years 8 hour ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
159
click to vote
SOSP
1997
ACM
15 years 8 months ago
1997
ACM
Low-latency remote-write networks, such as DEC’s Memory Channel, provide the possibility of transparent, inexpensive, large-scale shared-memory parallel computing on clusters of...
226
click to vote
FPL
2010
Springer
15 years 4 months ago
2010
Springer
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
217
click to vote
PAISI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...