Sciweavers

1623 search results - page 12 / 325
» No Sorting
Sort
View
101
Voted
XIMEP
2005
ACM
90views Database» more  XIMEP 2005»
15 years 6 months ago
XPath 2.0: It Can Sort!
As XML finds its place in information technology, query languages for XML attract much attention. Among them XPath is the most known. This article reveals a surprising fact that ...
Pavel Hlousek
96
Voted
FCT
2005
Springer
15 years 6 months ago
A Faster and Simpler 2-Approximation Algorithm for Block Sorting
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N...
Wolfgang W. Bein, Lawrence L. Larmore, Linda Moral...
97
Voted
IPPS
2002
IEEE
15 years 5 months ago
On Cost-Optimal Merge of Two Intransitive Sorted Sequences
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
Jie Wu, Stephan Olariu
82
Voted
IPL
2006
88views more  IPL 2006»
15 years 22 days ago
On Quickselect, partial sorting and Multiple Quickselect
We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting probl...
Markus Kuba
109
Voted
NIPS
2008
15 years 2 months ago
Spike Feature Extraction Using Informative Samples
This paper presents a new spike feature extraction algorithm that targets real-time spike sorting and facilitates miniaturized microchip implementation. The proposed algorithm has...
Zhi Yang, Qi Zhao, Wentai Liu