154 search results - page 21 / 31 » ets 2011 |
92
Voted
EMNLP
2011
13 years 9 months ago
2011
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
115
click to vote
ESA
2011
Springer
13 years 9 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
107
click to vote
ESA
2011
Springer
13 years 9 months ago
2011
Springer
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
179
click to vote
ICDAR
2011
IEEE
13 years 9 months ago
2011
IEEE
—In this paper, we propose an improved method for text/graphics segmentation. Text/graphics separation is a crucial preprocessing step in document analysis before further analysi...
112
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...