Sciweavers

1852 search results - page 142 / 371
» Block-level link analysis
Sort
View
125
Voted
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 3 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...
81
Voted
WWW
2009
ACM
16 years 1 months ago
Ranking community answers via analogical reasoning
Due to the lexical gap between questions and answers, automatically detecting right answers becomes very challenging for community question-answering sites. In this paper, we prop...
Xudong Tu, Xin-Jing Wang, Dan Feng, Lei Zhang
126
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...
99
Voted
COMPSAC
2007
IEEE
15 years 7 months ago
An End-to-end Detection of Wormhole Attack in Wireless Ad-hoc Networks
Wormhole attack is a severe attack in wireless ad-hoc networks. Most of the previous work eliminate the effect of wormhole attack by examining the distance or communication time o...
Xia Wang, Johnny Wong
INFOCOM
2007
IEEE
15 years 7 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...