Sciweavers

2168 search results - page 309 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
CTRSA
2009
Springer
106views Cryptology» more  CTRSA 2009»
15 years 7 months ago
Communication-Efficient Private Protocols for Longest Common Subsequence
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
KDD
2010
ACM
161views Data Mining» more  KDD 2010»
15 years 5 months ago
Mass estimation and its applications
This paper introduces mass estimation—a base modelling mechanism in data mining. It provides the theoretical basis of mass and an efficient method to estimate mass. We show that...
Kai Ming Ting, Guang-Tong Zhou, Fei Tony Liu, Jame...
IJCAI
1997
15 years 4 months ago
Anytime Belief Revision
Belief Revision is a ubiquitous process underlying many forms of intelligent behaviour. The AGM paradigm is a powerful framework for modeling and implementing belief revision syst...
Mary-Anne Williams
124
Voted
AMAI
2006
Springer
15 years 3 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
CORR
2011
Springer
208views Education» more  CORR 2011»
14 years 10 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...