Sciweavers

25041 search results - page 288 / 5009
» Algorithms for Clustering Data
Sort
View
LAWEB
2006
IEEE
15 years 11 months ago
Analysis of Web Search Engine Clicked Documents
In this paper we process and analyze web search engine query and click data from the perspective of the documents (URL’s) selected. We initially define possible document categor...
David F. Nettleton, Liliana Calderón-Benavi...
PR
2008
170views more  PR 2008»
15 years 4 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
FPL
2006
Springer
125views Hardware» more  FPL 2006»
15 years 8 months ago
Application-Specific Memory Interleaving for FPGA-Based Grid Computations: A General Design Technique
Many compute-intensive applications generate single result values by accessing clusters of nearby points in grids of one, two, or more dimensions. Often, the performance of FGPA i...
Tom Van Court, Martin C. Herbordt
AINA
2006
IEEE
15 years 11 months ago
Modeling, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks
In this paper we study the problem of scheduling messages between two parallel machines connected by a low latency network during a data redistribution. We compare two approaches....
Emmanuel Jeannot, Frédéric Wagner
HPDC
2006
IEEE
15 years 11 months ago
Improving I/O Performance of Clustered Storage Systems by Adaptive Request Distribution
We develop an adaptive load distribution protocol for logical volume I/O workload in clustered storage systems. It exploits data redundancy among decentralized storage servers to ...
Changxun Wu, Randal C. Burns