3049 search results - page 600 / 610 » On the Convergence of Bound Optimization Algorithms |
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
POPL
2003
ACM
14 years 9 months ago
2003
ACM
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...