Sciweavers

4860 search results - page 339 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
CORR
2012
Springer
222views Education» more  CORR 2012»
14 years 2 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
SIAMCOMP
2008
84views more  SIAMCOMP 2008»
15 years 6 months ago
Resolution Is Not Automatizable Unless W[P] Is Tractable
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
Michael Alekhnovich, Alexander A. Razborov
183
Voted
IJON
2002
130views more  IJON 2002»
15 years 6 months ago
Error-backpropagation in temporally encoded networks of spiking neurons
For a network of spiking neurons that encodes information in the timing of individual spike times, we derive a supervised learning rule, SpikeProp, akin to traditional errorbackpr...
Sander M. Bohte, Joost N. Kok, Johannes A. La Pout...
182
Voted
GECCO
2007
Springer
148views Optimization» more  GECCO 2007»
16 years 25 days ago
Exploring the behavior of building blocks for multi-objective variation operator design using predator-prey dynamics
In this paper, we utilize a predator-prey model in order to identify characteristics of single-objective variation operators in the multi-objective problem domain. In detail, we a...
Christian Grimme, Joachim Lepping, Alexander Papas...
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 10 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo