854 search results - page 59 / 171 » Abstracting from Failure Probabilities |
185
click to vote
SRDS
1999
IEEE
15 years 8 months ago
1999
IEEE
Software distributed shared memory (DSM) improves the programmability of message-passing machines and workclusters by providing a shared memory abstract (i.e., a coherent global a...
120
click to vote
ALT
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees T(F), from a sample of trees independently drawn accordi...
128
click to vote
ICANN
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Keyword spotting is a detection task consisting in discovering the presence of specific spoken words in unconstrained speech. The majority of keyword spotting systems ar...
138
Voted
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
Abstract: We study the average-case learnability of DNF formulas in the model of learning from uniformly distributed random examples. We define a natural model of random monotone ...
159
click to vote
ICA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Mutual information (MI) is a common criterion in independent component analysis (ICA) optimization. MI is derived from probability density functions (PDF). There are scen...