2137 search results - page 266 / 428 » Experiments on Graph Clustering Algorithms |
DAC
1997
ACM
14 years 1 months ago
1997
ACM
: Hardware-software co-synthesis is the process of partitioning an embedded system specification into hardware and software modules to meet performance, power and cost goals. In t...
SIGIR
2008
ACM
13 years 9 months ago
2008
ACM
In most IR clustering problems, we directly cluster the documents, working in the document space, using cosine similarity between documents as the similarity measure. In many real...
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
SCALESPACE
2005
Springer
14 years 2 months ago
2005
Springer
In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construct...