Sciweavers

1279 search results - page 88 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
NIPS
2001
13 years 10 months ago
The Unified Propagation and Scaling Algorithm
In this paper we will show that a restricted class of constrained minimum divergence problems, named generalized inference problems, can be solved by approximating the KL divergen...
Yee Whye Teh, Max Welling
PG
2007
IEEE
14 years 3 months ago
Developable Strip Approximation of Parametric Surfaces with Global Error Bounds
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
Yong-Jin Liu, Yu-Kun Lai, Shi-Min Hu
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 9 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
WAOA
2005
Springer
112views Algorithms» more  WAOA 2005»
14 years 2 months ago
Partial Multicuts in Trees
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
Asaf Levin, Danny Segev
COMPGEOM
2010
ACM
14 years 1 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park