Sciweavers

109 search results - page 19 / 22
» A Thorough Experimental Study of Datasets for Frequent Items...
Sort
View
PIMRC
2010
IEEE
13 years 5 months ago
Contact surround in opportunistic networks
Abstract--Is the temporal dimension alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant re...
Nadjet Belblidia, Marcelo Dias de Amorim, Jeremie ...
KDD
2006
ACM
123views Data Mining» more  KDD 2006»
14 years 8 months ago
Mining rank-correlated sets of numerical attributes
We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...
Toon Calders, Bart Goethals, Szymon Jaroszewicz
ACL
2010
13 years 5 months ago
Growing Related Words from Seed via User Behaviors: A Re-Ranking Based Approach
Motivated by Google Sets, we study the problem of growing related words from a single seed word by leveraging user behaviors hiding in user records of Chinese input method. Our pr...
Yabin Zheng, Zhiyuan Liu, Lixing Xie
CIKM
2010
Springer
13 years 6 months ago
Document allocation policies for selective searching of distributed indexes
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...
Anagha Kulkarni, Jamie Callan
PIMRC
2010
IEEE
13 years 5 months ago
Improving link failure detection and response in IEEE 802.11 wireless ad hoc networks
Wireless multihop ad hoc networks face a multitude of challenging problems including highly dynamic multihop topologies, lossy and noisy communications channels, and sporadic conne...
Alvin C. Valera, Hwee-Pink Tan, Winston Khoon Guan...