1105 search results - page 108 / 221 » Approximate Spectral Clustering. |
116
Voted
GRID
2003
Springer
15 years 6 months ago
2003
Springer
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
105
click to vote
IPL
1998
15 years 13 days ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
101
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...
96
Voted
EOR
2010
15 years 25 days ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
108
Voted
CIKM
2000
Springer
15 years 5 months ago
2000
Springer
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based techniqu...