1272 search results - page 167 / 255 » The Set Cover with Pairs Problem |
140
click to vote
KES
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present a possibly great improvement while performing semisupervised learning tasks from training data sets when only a small fraction of the data pairs is labeled. In...
158
click to vote
CSL
2001
Springer
15 years 10 months ago
2001
Springer
We introduce a method of extending arbitrary categories by a terminal object and apply this method in various type theoretic settings. In particular, we show that categories that a...
161
click to vote
CVPR
1999
IEEE
15 years 10 months ago
1999
IEEE
We formulate stereo matching as an extremal surface extraction problem. This is made possible by embedding the disparity surface inside a volume where the surface is composed of v...
149
click to vote
WEBDB
1998
Springer
15 years 10 months ago
1998
Springer
The World Wide Web is a vast resource for information. At the same time it is extremely distributed. A particular type of data such as restaurant lists maybe scattered across thous...
159
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...