165 search results - page 11 / 33 » Representing Probabilistic Relations in RDF |
PKDD
2005
Springer
15 years 3 months ago
2005
Springer
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
IJCV
2000
14 years 9 months ago
2000
We describe how to model the appearance of a 3-D object using multiple views, learn such a model from training images, and use the model for object recognition. The model uses pro...
84
Voted
SSPR
2004
Springer
15 years 2 months ago
2004
Springer
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 relation...
113
click to vote
TOG
2012
13 years 1 days ago
2012
We present an approach to synthesizing shapes from complex domains, by identifying new plausible combinations of components from existing shapes. Our primary contribution is a new...
72
Voted
ECCV
2006
Springer
15 years 1 months ago
2006
Springer
This paper is an argument for two assertions: First, that by representing correspondence probabilistically, drastically more correspondence information can be extracted from image...