Sciweavers

627 search results - page 80 / 126
» Dual-Buffering Strategies in Object Bases
Sort
View
ANOR
2011
117views more  ANOR 2011»
13 years 1 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
SDM
2011
SIAM
198views Data Mining» more  SDM 2011»
13 years 22 days ago
Exemplar-based Robust Coherent Biclustering
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...
Kewei Tu, Xixiu Ouyang, Dingyi Han, Vasant Honavar
CVPR
2012
IEEE
12 years 10 days ago
Locality-constrained and spatially regularized coding for scene categorization
Improving coding and spatial pooling for bag-of-words based feature design have gained a lot of attention in recent works addressing object recognition and scene classification. ...
Aymen Shabou, Hervé Le Borgne
CVPR
2012
IEEE
12 years 10 days ago
Large scale metric learning from equivalence constraints
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
Martin Köstinger, Martin Hirzer, Paul Wohlhar...
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 3 months ago
Combining partitions by probabilistic label aggregation
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
Tilman Lange, Joachim M. Buhmann