165 search results - page 11 / 33 » Representing Probabilistic Relations in RDF |
150
click to vote
PKDD
2005
Springer
15 years 10 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 ...
169
click to vote
IJCV
2000
15 years 4 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...
139
click to vote
SSPR
2004
Springer
15 years 10 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...
181
click to vote
TOG
2012
13 years 7 months 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...
124
click to vote
ECCV
2006
Springer
15 years 8 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...