4791 search results - page 142 / 959 » Clustering with partial information |
235
click to vote
ICOIN
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
176
click to vote
ERCIMDL
2008
Springer
15 years 8 months ago
2008
Springer
We present iClusterDL, a self-organising overlay network that supports information retrieval and filtering functionality in a digital library environment. iClusterDL is able to han...
165
click to vote
DKE
2007
15 years 6 months ago
2007
This paper presents a methodology for knowledge acquisition from source code. We use data mining to support semiautomated software maintenance and comprehension and provide practi...
155
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
Knowledge of relationships among categories is of the interest in different domains such as text classification, content analysis, and text mining. We propose and evaluate approac...
170
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...