1389 search results - page 173 / 278 » Improved Approximation Algorithms for Label Cover Problems |
147
click to vote
JMLR
2010
14 years 10 months ago
2010
We consider the problem of reducing the dimensionality of labeled data for classification. Unfortunately, the optimal approach of finding the low-dimensional projection with minim...
156
click to vote
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Graph matching is an important problem in computer
vision. It is used in 2D and 3D object matching and recognition.
Despite its importance, there is little literature on
learnin...
134
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
We address the problem of academic conference homepage understanding for the Semantic Web. This problem consists of three labeling tasks - labeling conference function pages, func...
115
click to vote
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
165
click to vote
SODA
2010
ACM
16 years 16 days ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...