4860 search results - page 602 / 972 » SNPs Problems, Complexity, and Algorithms |
147
click to vote
NIPS
2000
15 years 6 months ago
2000
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. As s...
136
Voted
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
Increasing teamwork between agents typically increases the performance of a multi-agent system, at the cost of increased communication and higher computational complexity. This wo...
143
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
138
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...
159
Voted
PVLDB
2010
15 years 3 months ago
2010
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...