Sciweavers

112 search results - page 8 / 23
» Neighborhood based fast graph search in large networks
Sort
View
CIKM
2008
Springer
14 years 11 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
15 years 10 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
VTC
2006
IEEE
110views Communications» more  VTC 2006»
15 years 3 months ago
DeuceScan: Deuce-Based Fast Handoff Scheme in IEEE 802.11 Wireless Networks
— WLANs will become a major portion of the fourth generation (4G) cellular system. The seamless handoff problem in WLANs is a very important design issue to support the new astou...
Yuh-Shyan Chen, Chung-Kai Chen, Ming-Chin Chuang
93
Voted
CIKM
2010
Springer
14 years 8 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
WEBI
2009
Springer
15 years 4 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova