Sciweavers

15120 search results - page 2743 / 3024
» Learning with Local Models
Sort
View
JAC
2008
15 years 8 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
LREC
2008
81views Education» more  LREC 2008»
15 years 8 months ago
Speech Errors on Frequently Observed Homophones in French: Perceptual Evaluation vs Automatic Classification
The present contribution aims at increasing our understanding of automatic speech recognition (ASR) errors involving frequent homophone or almost homophone words by confronting th...
Rena Nemoto, Ioana Vasilescu, Martine Adda-Decker
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 8 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
AAAI
1998
15 years 8 months ago
Probabilistic Frame-Based Systems
Two of the most important threads of work in knowledge representation today are frame-based representation systems (FRS's) and Bayesian networks (BNs). FRS's provide an ...
Daphne Koller, Avi Pfeffer
COLING
1996
15 years 8 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
« Prev « First page 2743 / 3024 Last » Next »