Sciweavers

1272 search results - page 167 / 255
» The Set Cover with Pairs Problem
Sort
View
KES
2004
Springer
14 years 3 months ago
Semi-supervised Learning from Unbalanced Labeled Data - An Improvement
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...
Te Ming Huang, Vojislav Kecman
CSL
2001
Springer
14 years 2 months ago
Life without the Terminal Type
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...
Lutz Schröder
CVPR
1999
IEEE
14 years 2 months ago
A Volumetric Stereo Matching Method: Application to Image-Based Modeling
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...
Qian Chen, Gérard G. Medioni
WEBDB
1998
Springer
96views Database» more  WEBDB 1998»
14 years 2 months ago
Extracting Patterns and Relations from the World Wide Web
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...
Sergey Brin
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
14 years 2 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
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...
Noga Alon, Nabil Kahale