Sciweavers

9260 search results - page 1660 / 1852
» Posterior distributions are computable from predictive distr...
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...
CLUSTER
2008
IEEE
16 years 1 months ago
Reliable adaptable Network RAM
Abstract—We present reliability solutions for adaptable Network RAM systems running on general-purpose clusters. Network RAM allows nodes with over-committed memory to swap pages...
Tia Newhall, Daniel Amato, Alexandr Pshenichkin
ATAL
2007
Springer
16 years 23 days ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone
SEMWEB
2007
Springer
16 years 20 days ago
Change Paths in Reasoning!
Millions of research funding has been put down to develop - what I call - old forms - of reasoning that are characterized by strong focus on theoretical properties and strict adher...
Raphael Volz
FOCS
2006
IEEE
16 years 19 days ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor
« Prev « First page 1660 / 1852 Last » Next »