Sciweavers

76665 search results - page 15068 / 15333
» A proposed
Sort
View
MST
2007
167views more  MST 2007»
15 years 7 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
MTA
2007
141views more  MTA 2007»
15 years 7 months ago
Flexible integration of multimedia sub-queries with qualitative preferences
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...
NA
2007
147views more  NA 2007»
15 years 7 months ago
An adaptive spectral least-squares scheme for the Burgers equation
A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these scheme...
Wilhelm Heinrichs
NECO
2007
129views more  NECO 2007»
15 years 7 months ago
Variational Bayes Solution of Linear Neural Networks and Its Generalization Performance
It is well-known that, in unidentifiable models, the Bayes estimation provides much better generalization performance than the maximum likelihood (ML) estimation. However, its ac...
Shinichi Nakajima, Sumio Watanabe
NECO
2007
258views more  NECO 2007»
15 years 7 months ago
Reinforcement Learning Through Modulation of Spike-Timing-Dependent Synaptic Plasticity
The persistent modification of synaptic efficacy as a function of the relative timing of pre- and postsynaptic spikes is a phenomenon known as spiketiming-dependent plasticity (...
Razvan V. Florian
« Prev « First page 15068 / 15333 Last » Next »