Sciweavers

170 search results - page 22 / 34
» On the Probability of the Number of Solutions for the P4P Pr...
Sort
View
ICDT
2009
ACM
119views Database» more  ICDT 2009»
14 years 8 months ago
Analysis of sampling techniques for association rule mining
In this paper, we present a comprehensive theoretical analysis of the sampling technique for the association rule mining problem. Most of the previous works have concentrated only...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...
IPL
2007
72views more  IPL 2007»
13 years 7 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
AAAI
2006
13 years 8 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
HIPC
2003
Springer
14 years 19 days ago
A Parallel Iterative Improvement Stable Matching Algorithm
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
Enyue Lu, S. Q. Zheng
ANSS
2004
IEEE
13 years 11 months ago
Markov Model Based Congestion Control for TCP
The Random Early Detection (RED) scheme for congestion control in TCP is well known over a decade. Due to a number of control parameters in RED, it cannot make acceptable packet-d...
Shan Suthaharan