80 search results - page 9 / 16 » Data reduction and exact algorithms for clique cover |
113
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
In many real-world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable a se...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
A large family of algorithms for dimensionality reduction end with solving a Trace Ratio problem in the form of arg maxW Tr(WT SpW)/Tr(WT SlW)1 , which is generally transformed in...
104
click to vote
BMCBI
2006
14 years 11 months ago
2006
Background: Supervised learning for classification of cancer employs a set of design examples to learn how to discriminate between tumors. In practice it is crucial to confirm tha...
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
We show the underpinnings of a method for summarizing documents: it ingests a document and automatically highlights a small set of sentences that are expected to cover the differ...
COMPGEOM
2001
ACM
15 years 3 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...