Sciweavers

1391 search results - page 109 / 279
» Complexity Limitations on Quantum Computation
Sort
View
NIPS
2007
13 years 9 months ago
Theoretical Analysis of Learning with Reward-Modulated Spike-Timing-Dependent Plasticity
Reward-modulated spike-timing-dependent plasticity (STDP) has recently emerged as a candidate for a learning rule that could explain how local learning rules at single synapses su...
Robert A. Legenstein, Dejan Pecevski, Wolfgang Maa...
IGPL
2006
107views more  IGPL 2006»
13 years 8 months ago
Undecidability over Continuous Time
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
Jerzy Mycka, José Félix Costa
PRL
2002
95views more  PRL 2002»
13 years 7 months ago
Dissimilarity representations allow for building good classifiers
In this paper, a classification task on dissimilarity representations is considered. A traditional way to discriminate between objects represented by dissimilarities is the neares...
Elzbieta Pekalska, Robert P. W. Duin
SAC
2008
ACM
13 years 7 months ago
PHALANX: a graph-theoretic framework for test case prioritization
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
Murali Krishna Ramanathan, Mehmet Koyutürk, A...
IJDMB
2010
61views more  IJDMB 2010»
13 years 6 months ago
On a novel coalescent model for genome-wide evolution of Copy Number Variations
: Since we are limited in our knowledge of human demographic history and variations of recombination and mutation rates, large-scale computer simulation is a necessary tool in gene...
Antonina Mitrofanova, Bhubaneswar (Bud) Mishra