Sciweavers

3946 search results - page 426 / 790
» The computational complexity of choice sets
Sort
View
AAAI
2006
15 years 9 months ago
Learning Systems of Concepts with an Infinite Relational Model
Relationships between concepts account for a large proportion of semantic knowledge. We present a nonparametric Bayesian model that discovers systems of related concepts. Given da...
Charles Kemp, Joshua B. Tenenbaum, Thomas L. Griff...
CVPR
2008
IEEE
16 years 9 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
CP
2000
Springer
15 years 11 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
CVPR
2012
IEEE
13 years 10 months ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing
CVPR
2006
IEEE
16 years 9 months ago
Learning Object Shape: From Drawings to Images
We consider the important challenge of recognizing a variety of deformable object classes in images. Of fundamental importance and particular difficulty in this setting is the pro...
Gal Elidan, Geremy Heitz, Daphne Koller