1146 search results - page 155 / 230 » Finite cupping sets |
140
click to vote
CAP
2010
14 years 11 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
145
Voted
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Matching and registration of shapes is a key issue in Computer Vision, Pattern Recognition, and Medical Image Analysis. This paper presents a shape representation framework based ...
236
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
137
click to vote
COLING
1992
15 years 5 months ago
1992
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
DAM
2008
15 years 4 months ago
2008
We present the exact solution of the asymptotics of the multiple packing problem in a finite space with a sum-type metric. 1 Consider the space Qn of n-tuples over a finite set Q ...