Sciweavers

704 search results - page 55 / 141
» A Note on Typing Feature Structures
Sort
View
ISTCS
1993
Springer
15 years 6 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag
AAAI
2008
15 years 4 months ago
Dormant Independence
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
Ilya Shpitser, Judea Pearl
DISOPT
2006
155views more  DISOPT 2006»
15 years 2 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin
TCOM
2010
106views more  TCOM 2010»
15 years 25 days ago
Achievable information rates for channels with insertions, deletions, and intersymbol interference with i.i.d. inputs
—We propose to use various trellis structures to characterize different types of insertion and deletion channels. We start with binary independent and identically distributed (i....
Jun Hu, Tolga M. Duman, M. Fatih Erden, Aleksandar...
COLING
1990
15 years 3 months ago
Organizing linguistic knowledge for multilingual generation
We propose an architecture for the organisation of linguistic knowledge which allows to (1) separately formulate generalizations for different types of linguistic information, and...
Martin C. Emele, Ulrich Heid, Stefan Momma, R&eacu...