5019 search results - page 90 / 1004 » On the Reflexivity of Point Sets |
139
click to vote
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
179
click to vote
PRICAI
1998
Springer
15 years 10 months ago
1998
Springer
Weaddress the general problemof finding algorithms for efficient, qualitative, point-basedtemporalreasoning over a set of operations. Weconsider general reasonerstailored for temp...
148
click to vote
AUSAI
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a logic-based bargaining solution based on Zhang and Zhang's framework. It is shown that if the demand sets of players are logically closed, the solution s...
128
click to vote
COMGEO
2008
ACM
15 years 6 months ago
2008
ACM
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting ...
164
click to vote
CCCG
2009
15 years 7 months ago
2009
There are many depth measures on point sets that yield centerpoint theorems. These theorems guarantee the existence of points of a specified depth, a kind of geometric median. How...