Sciweavers

5785 search results - page 725 / 1157
» Approximability of Probability Distributions
Sort
View
COGSCI
2002
108views more  COGSCI 2002»
15 years 6 months ago
Statistical models for the induction and use of selectional preferences
Selectional preferences have a long history in both generative and computational linguistics. However, since the publication of Resnik's dissertation in 1993, a new approach ...
Marc Light, Warren R. Greiff
CORR
2000
Springer
134views Education» more  CORR 2000»
15 years 6 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
CORR
2002
Springer
118views Education» more  CORR 2002»
15 years 6 months ago
Unsupervised discovery of morphologically related words based on orthographic and semantic similarity
We present an algorithm that takes an unannotated corpus as its input, and returns a ranked list of probable morphologically related pairs as its output. The algorithm tries to di...
Marco Baroni, Johannes Matiasek, Harald Trost
ETT
2000
106views Education» more  ETT 2000»
15 years 6 months ago
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
Igal Sason, Shlomo Shamai
IJON
2000
76views more  IJON 2000»
15 years 6 months ago
Fast neural network simulations with population density methods
The complexity of neural networks of the brain makes studying these networks through computer simulation challenging. Conventional methods, where one models thousands of individua...
Duane Q. Nykamp, Daniel Tranchina