1731 search results - page 288 / 347 » Maximum likelihood analysis of algorithms and data structure... |
SIGIR
2004
ACM
14 years 1 months ago
2004
ACM
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
DAC
1997
ACM
14 years 13 hour ago
1997
ACM
The design process for xed-point implementations either in software or in hardware requires a bit-true speci cation of the algorithm in order to analyze quantization e ects on an...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
ISPD
2005
ACM
14 years 1 months ago
2005
ACM
Research in floorplanning and block-packing has generated a variety of data structures to represent spatial configurations of circuit modules. Much of this work focuses on the g...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...