1601 search results - page 147 / 321 » Closed Sets for Labeled Data |
202
click to vote
ESWS
2005
Springer
15 years 12 months ago
2005
Springer
While classic information retrieval methods return whole documents as a result of a query, many information demands would be better satisfied by fine-grain access inside the docu...
161
click to vote
IJCAI
2007
15 years 7 months ago
2007
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task ...
255
click to vote
PODS
2009
ACM
16 years 6 months ago
2009
ACM
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
161
click to vote
SPIRE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
156
click to vote
FOCS
2006
IEEE
16 years 12 days ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...