1274 search results - page 78 / 255 » The Geometry of Coin-Weighing Problems |
CVPR
2006
IEEE
15 years 2 days ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
COMPGEOM
1995
ACM
14 years 1 months ago
1995
ACM
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
COCOA
2008
Springer
13 years 12 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
COCOA
2008
Springer
13 years 12 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...