Sciweavers

2869 search results - page 264 / 574
» The Inference Problem: A Survey
Sort
View
AAAI
2006
15 years 8 months ago
Inexact Matching of Ontology Graphs Using Expectation-Maximization
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
Prashant Doshi, Christopher Thomas
NIPS
2004
15 years 8 months ago
Sharing Clusters among Related Groups: Hierarchical Dirichlet Processes
We propose the hierarchical Dirichlet process (HDP), a nonparametric Bayesian model for clustering problems involving multiple groups of data. Each group of data is modeled with a...
Yee Whye Teh, Michael I. Jordan, Matthew J. Beal, ...
ICML
2010
IEEE
15 years 8 months ago
Budgeted Nonparametric Learning from Data Streams
We consider the problem of extracting informative exemplars from a data stream. Examples of this problem include exemplarbased clustering and nonparametric inference such as Gauss...
Ryan Gomes, Andreas Krause
ICASSP
2010
IEEE
15 years 7 months ago
On distance reconstruction for sensor network localization
Sensor localization typically exploits distance measurements to infer sensor positions with respect to known anchor nodes. Missing or unreliable measurements for specific nodes c...
Phillip A. Regalia, Jing Wang
WABI
2010
Springer
143views Bioinformatics» more  WABI 2010»
15 years 5 months ago
Swiftly Computing Center Strings
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
Franziska Hufsky, Léon Kuchenbecker, Kathar...