Search
Skip to Search Results- 2Graphical models
- 2Inlining
- 1Approximation algorithms
- 1BN classifiers
- 1Bayesian belief network
- 1Capacitated Multicast Routing
-
A comparison of Junction Tree and Relaxation Algorithms for point matching using different distance metrics
Download2004
Barone, Dante, Caelli, Terry, Caetano, Tiberio
Technical report TR04-04. We have developed a polynomial time optimal method for a class of attributed graph matching problems using the Junction Tree algorithm from Graphical Models. In this paper we compare this method with standard probabilistic relaxation labeling using different forms of...
-
2004
Barone, Dante, Caetano, Tiberio, Caelli, Terry
Technical report TR04-03. We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relations over a simple triangulated graph that retains the same informational content as the...
-
2004
Technical report TR04-23. Precalculating irradiance for photon maps is an enhancement to the photon mapping method that was proposed by Christensen to reduce redundant irradiance calculations during rendering. In this enhancement, irradiance values are precalculated at the location of photons in...
-
2004
Technical report TR04-13. Existing random models for the constraint satisfaction problem (CSP) all require an extremely low constraint tightness in order to have non-trivial threshold behaviors and guaranteed hard instances at the threshold. We study the possibility of designing random CSP models...
-
2004
Technical report TR04-16. This thesis deals with the problem of finding images that contain a given query sub-image, the so-called Content-Based sub-Image Retrieval (CBsIR) problem. We propose a scheme named the Hierarchical Tree Matching (HTM), which relies on a hierarchical tree that encodes...
-
2004
Oliveira, Stanley, Zaiane, Osmar
Technical report TR04-17. Preserving privacy of individuals when data are shared for clustering is a complex problem. The challenge is how to protect the underlying attribute values subjected to clustering without jeopardizing the similarity between data objects under analysis. To address this...
-
2004
Technical report TR04-22. Model selection problem in Bayesian belief network (BN) structure learning is a classicial problem in the BN literature. To do model selection in BN structure learning, we need a evaluation score and a searching procedure. The generative criteria, AIC, BIC and BDe, are...
-
2004
Technical report TR04-01. Object-oriented frameworks are often misused because programmers do not fully understand them. This dissertation investigates the feasibility and effectiveness of detecting framework constraints from framework-based applications; framework constraints are syntactic rules...
-
2004
Technical report TR04-26. Switch-case statements provide a concise way to express multi-way branching control flow semantics. Switch-cases are common in programs, including script parsers, compilers and virtual machines. Because they occur in widely used programs, optimization for switch-cases...