1316 search results - page 17 / 264 » Comparing mathematical models on the problem of network infe... |
104
click to vote
RECOMB
2004
Springer
16 years 2 months ago
2004
Springer
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— In many networked applications, independent caching agents cooperate by servicing each other’s miss streams, without revealing the operational details of the caching mechanis...
166
Voted
UAI
2008
15 years 3 months ago
2008
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
112
Voted
JAIR
2007
15 years 1 months ago
2007
This paper introduces and analyzes a battery of inference models for the problem of semantic role labeling: one based on constraint satisfaction, and several strategies that model...
119
Voted
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Two approaches have been used to perform approximate inference in Bayesian networks for which exact inference is infeasible: employing an approximation algorithm, or appr...