Sciweavers

499 search results - page 44 / 100
» A Search Algorithm for Clusters in a Network or Graph
Sort
View
WWW
2009
ACM
14 years 2 months ago
Building term suggestion relational graphs from collective intelligence
This paper proposes an effective approach to provide relevant search terms for conceptual Web search. ‘Semantic Term Suggestion’ function has been included so that users can f...
Jyh-Ren Shieh, Yung-Huan Hsieh, Yang-Ting Yeh, Tse...
GROUP
2005
ACM
14 years 1 months ago
Searching for expertise in social networks: a simulation of potential strategies
People search for people with suitable expertise all of the time in their social networks – to answer questions or provide help. Recently, efforts have been made to augment this...
Jun Zhang, Mark S. Ackerman
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
14 years 4 months ago
Clustering for processing rate optimization
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
Chuan Lin, Jia Wang, Hai Zhou
CIKM
2008
Springer
13 years 9 months ago
Peer-to-peer similarity search over widely distributed document collections
This paper addresses the challenging problem of similarity search over widely distributed ultra-high dimensional data. Such an application is retrieval of the top-k most similar d...
Christos Doulkeridis, Kjetil Nørvåg, ...
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 10 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...