Sciweavers

1941 search results - page 41 / 389
» On the Hardness of Approximate Reasoning
Sort
View
SPEECH
2010
89views more  SPEECH 2010»
14 years 6 months ago
Which words are hard to recognize? Prosodic, lexical, and disfluency factors that increase speech recognition error rates
Despite years of speech recognition research, little is known about which words tend to be misrecognized and why. Previous work has shown that errors increase for infrequent words...
Sharon Goldwater, Daniel Jurafsky, Christopher D. ...
TEC
2012
195views Formal Methods» more  TEC 2012»
13 years 2 months ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López
EUSFLAT
2009
173views Fuzzy Logic» more  EUSFLAT 2009»
14 years 9 months ago
Application of Zadeh's Impossibility Principle to Approximate Explanation
Abstract: We consider application of Zadeh's impossibility principle and extended logic FLe to approximate scientific explanation from the standpoint of the philosophy of scie...
Vesa A. Niskanen
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
15 years 28 days ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
KR
1992
Springer
15 years 3 months ago
Order of Magnitude Reasoning using Logarithms
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
P. Pandurang Nayak