Sciweavers

1760 search results - page 236 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
ICDCS
2008
IEEE
14 years 2 months ago
Fair K Mutual Exclusion Algorithm for Peer to Peer Systems
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
Vijay Anand Reddy, Prateek Mittal, Indranil Gupta
ICUIMC
2009
ACM
14 years 2 months ago
Proposal and evaluation of multiple gateways distribution method for wireless mesh network
Researches on the wireless mesh network in which access points (APs) of a wireless LAN are connected by an ad-hoc networks are recently drawing much attention. In the wireless mes...
Masashi Ito, Toshihiro Shikama, Akira Watanabe
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 8 months ago
Detecting research topics via the correlation between graphs and texts
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...
Yookyung Jo, Carl Lagoze, C. Lee Giles
FLAIRS
2007
13 years 10 months ago
Indexing Documents by Discourse and Semantic Contents from Automatic Annotations of Texts
The basic aim of the model proposed here is to automatically build semantic metatext structure for texts that would allow us to search and extract discourse and semantic informati...
Brahim Djioua, Jean-Pierre Desclés
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...