Sciweavers

4419 search results - page 558 / 884
» Information Science in Transition
Sort
View
ICALP
2009
Springer
16 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...
ICALP
2009
Springer
16 years 7 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
SIGMOD
2004
ACM
157views Database» more  SIGMOD 2004»
16 years 7 months ago
BIO-AJAX: An Extensible Framework for Biological Data Cleaning
As databases become more pervasive through the biological sciences, various data quality issues regarding data legacy, data uniformity and data duplication arise. Due to the natur...
Katherine G. Herbert, Narain H. Gehani, William H....
ICSE
2003
IEEE-ACM
16 years 6 months ago
Using Benchmarking to Advance Research: A Challenge to Software Engineering
Benchmarks have been used in computer science to compare the performance of computer systems, information retrieval algorithms, databases, and many other technologies. The creatio...
Susan Elliott Sim, Steve M. Easterbrook, Richard C...
ICSE
2005
IEEE-ACM
16 years 6 months ago
Some myths of software engineering education
Based on many years of teaching software engineering, I present a number of lessons I have learned over the years. I do so in the form of a series of myths, the reverse of which c...
Hans van Vliet