Sciweavers

716 search results - page 74 / 144
» Algorithmic Issues in Coding Theory
Sort
View
151
Voted
BC
2007
107views more  BC 2007»
15 years 6 months ago
Decoding spike train ensembles: tracking a moving stimulus
We consider the issue of how to read out the information from nonstationary spike train ensembles. Based on the theory of censored data in statistics, we propose a ‘censored’ m...
Enrico Rossoni, Jianfeng Feng
CL
2002
Springer
15 years 6 months ago
Orderly communication in the Ambient Calculus
The Ambient Calculus (henceforth, AC) was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [9]. We present a type system for AC ...
Torben Amtoft, A. J. Kfoury, Santiago M. Peric&aac...
143
Voted
NIPS
1994
15 years 7 months ago
Reinforcement Learning with Soft State Aggregation
It is widely accepted that the use of more compact representations than lookup tables is crucial to scaling reinforcement learning (RL) algorithms to real-world problems. Unfortun...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...
171
Voted
BMCBI
2010
155views more  BMCBI 2010»
15 years 6 months ago
A flexible R package for nonnegative matrix factorization
Background: Nonnegative Matrix Factorization (NMF) is an unsupervised learning technique that has been applied successfully in several fields, including signal processing, face re...
Renaud Gaujoux, Cathal Seoighe
WWW
2004
ACM
16 years 6 months ago
The webgraph framework I: compression techniques
Studying Web graphs is often difficult due to their large size. Recently, several proposals have been published about various techniques that allow to store a Web graph in memory ...
Paolo Boldi, Sebastiano Vigna