Sciweavers

739 search results - page 43 / 148
» Sorting Algorithms
Sort
View
NIPS
2008
13 years 10 months ago
Kernelized Sorting
Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we...
Novi Quadrianto, Le Song, Alex J. Smola
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 9 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
14 years 2 months ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher
ICASSP
2011
IEEE
13 years 15 days ago
Wavelet footprints for detection and sorting of extracellular neural action potentials
Spike detection and sorting is a fundamental step in the analysis of extracellular neural recording. Here, we propose a combined spike detection-feature extraction algorithm that ...
Ki Yong Kwon, Karim G. Oweiss
RECOMB
2006
Springer
14 years 9 months ago
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
Martin Bader, Enno Ohlebusch