Many parameter estimation problems admit divide and conquer or partitioning techniques in order to reduce a highdimensional task into several reduced-dimension problems. These tec...
Abstract. This paper proposes exploiting both explicit and mined metadata for enriching Web searching with exploration services. On-line results clustering is useful for providing ...
Wedescribea novel approachfor clustering collectionsof sets,andits applicationto theanalysis and mining of categoricaldata. By "categorical data," we meantableswith fiel...
David Gibson, Jon M. Kleinberg, Prabhakar Raghavan
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
Abstract. Database systems have been vital for all forms of data processing for a long time. In recent years, the amount of processed data has been growing dramatically, even in sm...