8437 search results - page 190 / 1688 » Preferences over Sets |
173
click to vote
SSPR
2004
Springer
15 years 11 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...
291
click to vote
ICDT
1995
ACM
15 years 10 months ago
1995
ACM
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
165
click to vote
JCT
2006
15 years 6 months ago
2006
A k-majority tournament T on a finite vertex set V is defined by a set of 2k - 1 linear orderings of V, with u v if and only if u lies above v in at least k of the orders. Motiva...
191
click to vote
PAMI
2007
15 years 6 months ago
2007
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
147
click to vote
ACL
2010
15 years 4 months ago
2010
We present a discriminative model that directly predicts which set of phrasal translation rules should be extracted from a sentence pair. Our model scores extraction sets: nested ...