2157 search results - page 89 / 432 » Optimal Fast Hashing |
145
click to vote
AAECC
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
145
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
111
click to vote
ICDCN
2009
Springer
15 years 11 months ago
2009
Springer
We develop an analytical model of information dissemination for a gossip protocol. With this model we analyse how fast an item is replicated through a network. We also determine th...
138
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
142
click to vote
PVLDB
2010
15 years 2 months ago
2010
The need to improve a suboptimal execution plan picked by the query optimizer for a repeatedly run SQL query arises routinely. Complex expressions, skewed or correlated data, and ...