Sciweavers

1512 search results - page 149 / 303
» Inference Algorithms for Similarity Networks
Sort
View
JMLR
2010
149views more  JMLR 2010»
14 years 5 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
PR
2011
14 years 29 days ago
Content-based image retrieval with relevance feedback using random walks
In this paper we propose a novel approach to content-based image retrieval with relevance feedback, which is based on the random walker algorithm introduced in the context of inte...
Samuel Rota Bulò, Massimo Rabbi, Marcello P...
103
Voted
DEBS
2009
ACM
15 years 2 months ago
Efficient event-based resource discovery
The ability to find services or resources that satisfy some criteria is an important aspect of distributed systems. This paper presents an event-based architecture to support more...
Wei Yan, Songlin Hu, Vinod Muthusamy, Hans-Arno Ja...
CONEXT
2007
ACM
15 years 2 months ago
NetDiagnoser: troubleshooting network unreachabilities using end-to-end probes and routing data
The distributed nature of the Internet makes it difficult for a single service provider to troubleshoot the disruptions experienced by its customers. We propose NetDiagnoser, a tr...
Amogh Dhamdhere, Renata Teixeira, Constantine Dovr...
106
Voted
AINA
2003
IEEE
15 years 1 months ago
Formal Verification of Condition Data Flow Diagrams for Assurance of Correct Network Protocols
Condition Data Flow Diagrams (CDFDs) are a formalized notation resulting from the integration of Yourdon Data Flow Diagrams, Petri Nets, and pre-post notation. They are used in th...
Shaoying Liu