57 search results - page 2 / 12 » Bead-Sort: A Natural Sorting Algorithm |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
NIPS
2007
13 years 6 months ago
2007
Natural sounds are structured on many time-scales. A typical segment of speech, for example, contains features that span four orders of magnitude: Sentences (∼1 s); phonemes (âˆ...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
JCM
2006
13 years 5 months ago
2006
There are many difficult challenges ahead in the design of an energy-efficient communication stack for wireless sensor networks. Due to the severe sensor node constraints, protocol...