6110 search results - page 381 / 1222 » Approximate Computing |
195
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
320
click to vote
Book
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
183
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
184
Voted
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
148
click to vote
NAACL
1994
15 years 8 months ago
1994
We describe the design of Comlex Syntax, a computational lexicon providing detailed syntactic information for approximately 38,000 EnglJish headwords. We consider the types of err...