Sciweavers

4345 search results - page 589 / 869
» Relational Reinforcement Learning
Sort
View
COLING
2010
14 years 11 months ago
Near-synonym Lexical Choice in Latent Semantic Space
We explore the near-synonym lexical choice problem using a novel representation of near-synonyms and their contexts in the latent semantic space. In contrast to traditional latent...
Tong Wang, Graeme Hirst
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
14 years 11 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
SEE
2010
Springer
14 years 11 months ago
Engineering Good: How Engineering Metaphors Help us to Understand the Moral Life and Change Society
Engineering can learn from ethics, but ethics can also learn from engineering. In this paper, I discuss what engineering metaphors can teach us about practical philosophy. Using me...
Mark Coeckelbergh
CISISSPAIN
2011
14 years 8 months ago
Testing Ensembles for Intrusion Detection: On the Identification of Mutated Network Scans
In last decades there have been many proposals from the machine learning community in the intrusion detection field. One of the main problems that Intrusion Detection Systems (IDSs...
Silvia González, Javier Sedano, Álva...
142
Voted
IACR
2011
115views more  IACR 2011»
14 years 4 months ago
Pseudorandom Functions and Lattices
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
Abhishek Banerjee, Chris Peikert, Alon Rosen