Sciweavers

3145 search results - page 488 / 629
» Algebraic Linear Orderings
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 10 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
ERSHOV
1989
Springer
15 years 10 months ago
Experiments with Implementations of Two Theoretical Constructions
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
Torben Amtoft Hansen, Thomas Nikolajsen, Jesper La...
FOCS
2004
IEEE
15 years 9 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
15 years 7 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
WCE
2007
15 years 7 months ago
Procedures of Parameters' estimation of AR(1) models into lineal state-space models
—The objective of this paper is to study how algorithms of optimization affect the parametersestimation of Autoregressive AR(1)Models. In our research we have represented the AR...
Rouhia Noomene