Sciweavers

1679 search results - page 186 / 336
» Strong order equivalence
Sort
View
WINE
2007
Springer
97views Economy» more  WINE 2007»
14 years 3 months ago
K-NCC: Stability Against Group Deviations in Non-cooperative Computation
A function is non-cooperative computable [NCC] if honest agents can compute it by reporting truthfully their private inputs, while unilateral deviations by the players are not bene...
Itai Ashlagi, Andrey Klinger, Moshe Tennenholtz
JCST
2008
119views more  JCST 2008»
13 years 9 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
CORR
2002
Springer
141views Education» more  CORR 2002»
13 years 8 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
JNS
2010
107views more  JNS 2010»
13 years 3 months ago
Ground States and Critical Points for Aubry-Mather Theory in Statistical Mechanics
We consider statistical mechanics systems defined on a set with some symmetry properties (namely, the set admits an action by a group, which is finitely generated and residually fi...
Rafael de La Llave, Enrico Valdinoci
ICS
2010
Tsinghua U.
14 years 6 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman