Sciweavers

739 search results - page 39 / 148
» Sorting Algorithms
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
Information theoretic bounds on neural prosthesis effectiveness: The importance of spike sorting
We compute the capacity of neural prostheses using a vector Poisson process model for the neural population channel. For single-electrode stimulation prostheses, the capacity is p...
Ilan N. Goodman, Don H. Johnson
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 7 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
4OR
2006
118views more  4OR 2006»
13 years 7 months ago
Dealing with inconsistent judgments in multiple criteria sorting models
Sorting models consist in assigning alternatives evaluated on several criteria to ordered categories. To implement such models it is necessary to set the values of the preference p...
Vincent Mousseau, Luis C. Dias, José Rui Fi...
CPM
2004
Springer
94views Combinatorics» more  CPM 2004»
14 years 29 days ago
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
Firas Swidan, Michael A. Bender, Dongdong Ge, Sima...
ICALP
2009
Springer
14 years 7 months ago
The Number of Symbol Comparisons in QuickSort and QuickSelect
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
Brigitte Vallée, James Allen Fill, Julien C...