Sciweavers

3677 search results - page 613 / 736
» Is a probabilistic modeling
Sort
View
144
Voted
SUM
2007
Springer
15 years 9 months ago
Managing Uncertainty in Schema Matcher Ensembles
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...
Anan Marie, Avigdor Gal
108
Voted
ATAL
2005
Springer
15 years 9 months ago
Tunably decentralized algorithms for cooperative target observation
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
Sean Luke, Keith Sullivan, Liviu Panait, Gabriel C...
164
Voted
WWW
2008
ACM
15 years 3 months ago
A Novelty-based Clustering Method for On-line Documents
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...
Sophoin Khy, Yoshiharu Ishikawa, Hiroyuki Kitagawa
114
Voted
SIGGRAPH
2000
ACM
15 years 8 months ago
Sampling plausible solutions to multi-body constraint problems
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...
Stephen Chenney, David A. Forsyth
147
Voted
ICDCS
2006
IEEE
15 years 9 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
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...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer