Sciweavers

37 search results - page 5 / 8
» Counting independent sets up to the tree threshold
Sort
View
ICNP
2003
IEEE
15 years 2 months ago
Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach
A prerequisite for secure communication between two nodes in an ad hoc network is that the nodes share a key to bootstrap their trust relationship. In this paper, we present a sca...
Sencun Zhu, Shouhuai Xu, Sanjeev Setia, Sushil Jaj...
IJCAI
2003
14 years 10 months ago
Toward Conditional Models of Identity Uncertainty with Application to Proper Noun Coreference
Coreference analysis, also known as record linkage or identity uncertainty, is a difficult and important problem in natural language processing, databases, citation matching and ...
Andrew McCallum, Ben Wellner
VLDB
1997
ACM
78views Database» more  VLDB 1997»
15 years 1 months ago
Recovering Information from Summary Data
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...
Christos Faloutsos, H. V. Jagadish, Nikolaos Sidir...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
14 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
ICC
2007
IEEE
106views Communications» more  ICC 2007»
15 years 3 months ago
A Distributed Approach to End-to-End Network Topology Inference
Abstract— To construct an efficient overlay network, the information of underlay is important. However, the inference of an underlay topology is not easy. We consider using end-...
Xing Jin, Qiuyan Xia, Shueng-Han Gary Chan