12519 search results - page 429 / 2504 » Approximation Problems Categories |
212
click to vote
PAKDD
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-...
175
click to vote
IPSN
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
161
click to vote
SPIRE
2005
Springer
16 years 10 days ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
156
click to vote
GECCO
2004
Springer
16 years 7 days ago
2004
Springer
The colour of colon tissue, which depends on the tissue structure, its optical properties, and the quantities of the pigments present in it, can be predicted by a physics-based mod...
198
click to vote
SC
2003
ACM
16 years 3 days ago
2003
ACM
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. W...