Sciweavers

325 search results - page 65 / 65
» HyperGraphDB: A Generalized Graph Database
Sort
View
WWW
2011
ACM
12 years 11 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
JCDL
2011
ACM
272views Education» more  JCDL 2011»
12 years 7 months ago
CollabSeer: a search engine for collaboration discovery
Collaborative research has been increasingly popular and important in academic circles. However, there is no open platform available for scholars or scientists to effectively dis...
Hung-Hsuan Chen, Liang Gou, Xiaolong Zhang, Clyde ...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 3 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
CIKM
2010
Springer
13 years 3 months ago
SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, ...
DIMACS
1996
13 years 6 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin