7006 search results - page 289 / 1402 » Approximation Algorithms |
166
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
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...
149
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
133
click to vote
SIGGRAPH
1993
ACM
15 years 8 months ago
1993
ACM
Many of the current radiosity algorithms create a piecewise constant approximation to the actual radiosity. Through interpolation and extrapolation, a continuous solution is obtai...
130
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
117
click to vote
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...