Sciweavers

56 search results - page 3 / 12
» The Solution Space of Sorting by Reversals
Sort
View
RECOMB
2009
Springer
14 years 3 months ago
Counting All DCJ Sorting Scenarios
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
Marília D. V. Braga, Jens Stoye
ISCAS
2006
IEEE
102views Hardware» more  ISCAS 2006»
14 years 2 months ago
A low power merge cell processor for real-time spike sorting in implantable neural prostheses
Extremely low power consumption is the critical constraint for designing implantable neural decoders that inter- Desired face directly with the nervous system. Typically a system w...
M. D. Linderman, T. H. Meng
BTW
2007
Springer
183views Database» more  BTW 2007»
14 years 16 days ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
ENTCS
2006
127views more  ENTCS 2006»
13 years 8 months ago
Process Algebraic Non-product-forms
A generalization of the Reversed Compound Agent Theorem of Markovian process algebra is derived that yields separable, but non-product-form solutions for collections of interactin...
Peter G. Harrison
CEC
2008
IEEE
13 years 10 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ