Sciweavers

1209 search results - page 196 / 242
» Semi-Supervised Learning with Trees
Sort
View
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
ICALP
2005
Springer
14 years 1 months ago
Hierarchical Group Signatures
We introduce the notion of hierarchical group signatures. This is a proper generalization of group signatures, which allows multiple group managers organized in a tree with the si...
Mårten Trolin, Douglas Wikström
ECML
2004
Springer
14 years 1 months ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja
SAT
2004
Springer
89views Hardware» more  SAT 2004»
14 years 1 months ago
Using Rewarding Mechanisms for Improving Branching Heuristics
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
Elsa Carvalho, João P. Marques Silva
SDMW
2004
Springer
14 years 1 months ago
Using Secret Sharing for Searching in Encrypted Data
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
Richard Brinkman, Jeroen Doumen, Willem Jonker