3677 search results - page 613 / 736 » Is a probabilistic modeling |
177
click to vote
SUM
2007
Springer
16 years 14 days ago
2007
Springer
Schema matching is the task of matching between concepts describing the meaning of data in various heterogeneous, distributed data sources. With many heuristics to choose from, sev...
145
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
210
click to vote
WWW
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we describe a document clustering method called noveltybased document clustering. This method clusters documents based on similarity and novelty. The method assigns...
159
click to vote
SIGGRAPH
2000
ACM
15 years 10 months ago
2000
ACM
Traditional collision intensive multi-body simulations are difficult to control due to extreme sensitivity to initial conditions or model parameters. Furthermore, there may be mu...
178
click to vote
ICDCS
2006
IEEE
16 years 13 days ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...