Sciweavers

3934 search results - page 290 / 787
» A monothetic clustering method
Sort
View
RT
2000
Springer
15 years 10 months ago
Guaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity
Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing ...
Luc Leblanc, Pierre Poulin
COLING
2008
15 years 8 months ago
Using Hidden Markov Random Fields to Combine Distributional and Pattern-Based Word Clustering
Word clustering is a conventional and important NLP task, and the literature has suggested two kinds of approaches to this problem. One is based on the distributional similarity a...
Nobuhiro Kaji, Masaru Kitsuregawa
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 6 months ago
Generalization error bounds in semi-supervised classification under the cluster assumption
We consider semi-supervised classification when part of the available data is unlabeled. These unlabeled data can be useful for the classification problem when we make an assumpti...
Philippe Rigollet
CEC
2009
IEEE
16 years 1 months ago
A clustering particle swarm optimizer for dynamic optimization
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
Changhe Li, Shengxiang Yang
ATAL
2009
Springer
16 years 1 months ago
Lossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J....