5019 search results - page 75 / 1004 » On the Reflexivity of Point Sets |
166
click to vote
ARSCOM
2000
15 years 6 months ago
2000
The minimum number of incomplete blocks required to cover, exactly times, all t-element subsets from a set V of cardinality v (v > t) is denoted
154
click to vote
ECSQARU
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we investigate consonant random sets from the point of view of lattice theory. We introduce a new definition of consonancy and study its relationship with possibili...
159
click to vote
BMVC
2000
15 years 7 months ago
2000
A new object recognition method, the Invariant Pixel Set Signature (IPSS), is introduced. Objects are represented with a probability density on the space of invariants computed fr...
205
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
148
click to vote
ORL
2008
15 years 6 months ago
2008
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...