Sciweavers

5607 search results - page 728 / 1122
» Graph structure in the Web
Sort
View
IJCM
2002
92views more  IJCM 2002»
15 years 6 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
SIGMETRICS
2000
ACM
125views Hardware» more  SIGMETRICS 2000»
15 years 6 months ago
Resource management policies for e-commerce servers
Quality of service of e-commerce sites has been usually managed by the allocation of resources such as processors, disks, and network bandwidth, and by tracking conventional perfo...
Daniel A. Menascé, Rodrigo C. Fonseca, Virg...
SIGIR
2002
ACM
15 years 6 months ago
Generic summarization and keyphrase extraction using mutual reinforcement principle and sentence clustering
A novel method for simultaneous keyphrase extraction and generic text summarization is proposed by modeling text documents as weighted undirected and weighted bipartite graphs. Sp...
Hongyuan Zha
CIKM
2011
Springer
14 years 6 months ago
Content-driven detection of campaigns in social media
We study the problem of detecting coordinated free text campaigns in large-scale social media. These campaigns – ranging from coordinated spam messages to promotional and advert...
Kyumin Lee, James Caverlee, Zhiyuan Cheng, Daniel ...
EMNLP
2011
14 years 6 months ago
Random Walk Inference and Learning in A Large Scale Knowledge Base
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
Ni Lao, Tom M. Mitchell, William W. Cohen