62 search results - page 3 / 13 » Ultra-Perfect Sorting Scenarios |
NIPS
2004
13 years 6 months ago
2004
Spike sorting involves clustering spike trains recorded by a microelectrode according to the source neuron. It is a complicated problem, which requires a lot of human labor, partl...
TCBB
2010
12 years 12 months ago
2010
Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a neg...
RECOMB
2008
Springer
14 years 5 months ago
2008
Springer
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
ICDCSW
2003
IEEE
13 years 10 months ago
2003
IEEE
We present TOTA (“Tuples On The Air”), a novel middleware for supporting adaptive context-aware activities in dynamic network scenarios. The key idea in TOTA is to rely on spa...
IFIP
2003
Springer
13 years 10 months ago
2003
Springer
Whilst much effort has been put into the creation of routing algorithms to handle all sorts of mobility scenarios in ad-hoc networks, other fundamental issues, such as the addresse...