3068 search results - page 167 / 614 » Clustering with Multiple Graphs |
166
click to vote
ICPADS
2010
IEEE
15 years 1 months ago
2010
IEEE
Driven by the market demand for high-definition 3D graphics, commodity graphics processing units (GPUs) have evolved into highly parallel, multi-threaded, many-core processors, whi...
167
click to vote
PR
2008
15 years 3 months ago
2008
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...
153
click to vote
LCPC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of mu...
114
click to vote
ICCAD
2007
IEEE
16 years 27 days ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
177
click to vote
WEBDB
2007
Springer
15 years 10 months ago
2007
Springer
Clustering web search engine results for ambiguous keyword searches poses unique challenges. First, we show that one cannot readily import the frequency based feature ranking to c...