1623 search results - page 96 / 325 » No Sorting |
123
click to vote
DCC
2008
IEEE
16 years 4 months ago
2008
IEEE
Abstract. A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are inves...
149
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
142
click to vote
MEMOCODE
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract: We present an implementation of a highthroughput cryptosorter, capable of sorting an encrypted database of eight megabytes in .15 seconds; 1102 times faster than a softwa...
106
click to vote
ACII
2007
Springer
15 years 10 months ago
2007
Springer
We discuss an aspect of an affect-detection system used in edrama by intelligent conversational agents, namely affective interpretation of limited sorts of metaphorical utterance. ...
135
click to vote
PSIVT
2007
Springer
15 years 10 months ago
2007
Springer
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...