Sciweavers

2314 search results - page 135 / 463
» Monoids over domains
Sort
View
TCS
1998
15 years 1 months ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...
PAMI
2007
166views more  PAMI 2007»
15 years 1 months ago
A Bayesian, Exemplar-Based Approach to Hierarchical Shape Matching
—This paper presents a novel probabilistic approach to hierarchical, exemplar-based shape matching. No feature correspondence is needed among exemplars, just a suitable pairwise ...
Dariu Gavrila
JAIR
2010
145views more  JAIR 2010»
15 years 8 days ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
ICPR
2006
IEEE
16 years 2 months ago
Online Learning of Discriminative Patterns from Unlimited Sequences of Candidates
Recent research in object recognition has demonstrated the advantages of representing objects and scenes through localized patterns such as small image templates. In this paper we...
Ilkka Autio, Jussi T. Lindgren
ICIP
2009
IEEE
16 years 2 months ago
Affine Alignment Of Compound Objects: A Direct Approach
A direct approach for parametric estimation of 2D affine deformations between compound shapes is proposed. It provides the result as a least-square solution of a linear system of ...