Sciweavers

12194 search results - page 205 / 2439
» Numberings Optimal for Learning
Sort
View
CDC
2009
IEEE
107views Control Systems» more  CDC 2009»
15 years 11 months ago
Learning approaches to the Witsenhausen counterexample from a view of potential games
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
Na Li, Jason R. Marden, Jeff S. Shamma
COLT
2007
Springer
16 years 20 days ago
U-Shaped, Iterative, and Iterative-with-Counter Learning
This paper solves an important problem left open in the literature by showing that U-shapes are unnecessary in iterative learning. A U-shape occurs when a learner first learns, t...
John Case, Samuel E. Moelius
WMTE
2002
IEEE
15 years 11 months ago
KLeOS: A Personal, Mobile, Knowledge and Learning Organisation System
The design of a personal, mobile Knowledge and Learning Organisation System (KLeOS) is described. Studies of adult learning practice showed [1] that learning activity is mobile be...
Giasemi N. Vavoula, Mike Sharples
IACR
2011
158views more  IACR 2011»
14 years 6 months ago
Can Homomorphic Encryption be Practical?
Abstract. The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns for individuals and businesses alike. T...
Kristin Lauter, Michael Naehrig, Vinod Vaikuntanat...
ICASSP
2009
IEEE
16 years 1 months ago
Map approach to learning sparse Gaussian Markov networks
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...
Narges Bani Asadi, Irina Rish, Katya Scheinberg, D...