Search
Skip to Search Results- 2Graphical models
- 2Inlining
- 1Approximation algorithms
- 1BN classifiers
- 1Bayesian belief network
- 1Capacitated Multicast Routing
-
2004
Cai, Zhipeng, Lin, Guohui, Xue, Guoliang
Technical report TR04-12. For the Capacitated Multicast Routing Problem, we considered two models which are the Multicast k-Path Routing and the Multicast k-Tree Routing. We presented two improved approximation algorithms for them, which have worst case performance ratios of 3 and (2 + ρ) (ρ is...
-
2004
Technical report TR04-19. Despite the proposal of numerous tree-based structures for high-dimensional similarity searches, techniques based on a sequential scan, such as the VA-File, have been shown to be quite effective. In this thesis we present three new access structures which use sequential...
-
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
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
Hoover, Jim, Figueroa, Pablo, Boulanger, Pierre
Technical report TR04-06. In this document, we describe from different viewpoints our model for Virtual Reality applications. We give first an informal description of the basic concepts, the execution model, and some examples of modeling for devices, behaviors, and media content elements. Second,...
-
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-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
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...