Sciweavers

221 search results - page 41 / 45
» Random Indexing K-tree
Sort
View
WWW
2005
ACM
14 years 9 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
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
INFOCOM
2007
IEEE
14 years 2 months ago
A Cross-Layer Architecture to Exploit Multi-Channel Diversity with a Single Transceiver
—The design of multi-channel multi-hop wireless mesh networks is centered around the way nodes synchronize when they need to communicate. However, existing designs are confined ...
Jay A. Patel, Haiyun Luo, Indranil Gupta
SSD
2007
Springer
155views Database» more  SSD 2007»
14 years 2 months ago
MobiHide: A Mobilea Peer-to-Peer System for Anonymous Location-Based Queries
Abstract. Modern mobile phones and PDAs are equipped with positioning capabilities (e.g., GPS). Users can access public location-based services (e.g., Google Maps) and ask spatial ...
Gabriel Ghinita, Panos Kalnis, Spiros Skiadopoulos
INFOCOM
2006
IEEE
14 years 2 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo