1022 search results - page 82 / 205 » Adaptive Clustering Ensembles |
176
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
127
click to vote
EUROPAR
2004
Springer
15 years 10 months ago
2004
Springer
OLAP queries are typically heavy-weight and ad-hoc thus requiring high storage capacity and processing power. In this paper, we address this problem using a database cluster which...
137
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
Oscilloscopes and their cousins, logic analyzers, are the tools of choice for difficult electronic hardware problems. In the hands of a skilled engineer or technician, these tool...
144
Voted
IEICET
2008
15 years 4 months ago
2008
We propose a domain specific model for statistical machine translation. It is wellknown that domain specific language models perform well in automatic speech recognition. We show ...
155
click to vote
JMLR
2010
14 years 11 months ago
2010
We present an extension of convex-hull non-negative matrix factorization (CH-NMF) which was recently proposed as a large scale variant of convex non-negative matrix factorization ...