352 search results - page 5 / 71 » A local search approximation algorithm for k-means clusterin... |
CVPR
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper introduces a novel statistical mixture model for probabilistic grouping of distributional histogram data. Adopting the Bayesian framework, we propose to perform anneale...
101
click to vote
AAAI
2000
14 years 11 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
WAOA
2010
Springer
14 years 7 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
ERCIMDL
2000
Springer
15 years 1 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
ECIR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...