Sciweavers

3096 search results - page 232 / 620
» The Generalized FITC Approximation
Sort
View
SWAT
2004
Springer
156views Algorithms» more  SWAT 2004»
15 years 11 months ago
The Bottleneck Problem with Minimum Quantity Commitments
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
Andrew Lim, Zhou Xu
FOCS
2003
IEEE
15 years 11 months ago
Clustering with Qualitative Information
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
Moses Charikar, Venkatesan Guruswami, Anthony Wirt...
PSIVT
2009
Springer
139views Multimedia» more  PSIVT 2009»
15 years 10 months ago
Recovery Rate of Clustering Algorithms
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...
Fajie Li, Reinhard Klette
NIPS
2001
15 years 7 months ago
A Variational Approach to Learning Curves
We combine the replica approach from statistical physics with a variational approach to analyze learning curves analytically. We apply the method to Gaussian process regression. A...
Dörthe Malzahn, Manfred Opper
SODA
2004
ACM
173views Algorithms» more  SODA 2004»
15 years 7 months ago
Tabulation based 4-universal hashing with applications to second moment estimation
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...
Mikkel Thorup, Yin Zhang