985 search results - page 109 / 197 » Piercing Convex Sets |
118
click to vote
DIMACS
2001
15 years 5 months ago
2001
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
121
click to vote
CCCG
2003
15 years 5 months ago
2003
We show several natural questions about hinged dissections of polygons to be PSPACE-hard. The most basic of these is: Given a hinged set of pieces and two configurations for them...
111
click to vote
IPCO
2004
15 years 5 months ago
2004
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
127
click to vote
EUSFLAT
2003
15 years 5 months ago
2003
Perception based function (PBF) is given by the set of rules Ri:“If X is Ti then Y is Si”, where Ti is a linguistic term describing some fuzzy intervals Ai on the domain of re...
126
click to vote
NIPS
2004
15 years 5 months ago
2004
We provide a principle for semi-supervised learning based on optimizing the rate of communicating labels for unlabeled points with side information. The side information is expres...