16404 search results - page 909 / 3281 » A set coverage problem |
190
Voted
ECML
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We study the problem of learning from positive and unlabeled examples. Although several techniques exist for dealing with this problem, they all assume that positive exam...
179
Voted
COMPGEOM
2004
ACM
16 years 1 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
199
Voted
FOCS
1999
IEEE
15 years 12 months ago
1999
IEEE
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
187
click to vote
SIGCOMM
1999
ACM
15 years 12 months ago
1999
ACM
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the...
183
click to vote
ICCAD
1997
IEEE
15 years 12 months ago
1997
IEEE
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...