Sciweavers

21 search results - page 1 / 5
» Quickly Routing Searches Without Having to Move Content
Sort
View
IPTPS
2005
Springer
13 years 10 months ago
Quickly Routing Searches Without Having to Move Content
A great deal of work has been done to improve peerto-peer routing by strategically moving or replicating content. However, there are many applications for which a peer-to-peer arc...
Brian F. Cooper
COMCOM
2008
127views more  COMCOM 2008»
13 years 4 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...
INFOCOM
2007
IEEE
13 years 11 months ago
RMAC: A Routing-Enhanced Duty-Cycle MAC Protocol for Wireless Sensor Networks
—Duty-cycle MAC protocols have been proposed to meet the demanding energy requirements of wireless sensor networks. Although existing duty-cycle MAC protocols such as S-MAC are p...
Shu Du, Amit Kumar Saha, David B. Johnson
ICDE
2011
IEEE
224views Database» more  ICDE 2011»
12 years 8 months ago
SmartTrace: Finding similar trajectories in smartphone networks without disclosing the traces
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...
Costandinos Costa, Christos Laoudias, Demetrios Ze...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 5 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...