4315 search results - page 207 / 863 » Sorting in linear time |
100
Voted
ICSE
2005
IEEE-ACM
16 years 2 months ago
2005
IEEE-ACM
Which is the defect that causes a software failure? By comparing the program states of a failing and a passing run, we can identify the state differences that cause the failure. H...
159
Voted
ACSC
2007
IEEE
15 years 9 months ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
114
Voted
ISSAC
2004
Springer
15 years 8 months ago
2004
Springer
We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering t...
146
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
Clustering is an important characteristic of most sensor applications. In this paper we define COSMOS, the Cluster-based, heterOgeneouS MOdel for Sensor networks. The model assum...
117
Voted
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...