888 search results - page 103 / 178 » Improving Random Projections Using Marginal Information |
110
click to vote
COCO
1998
Springer
15 years 4 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
EGOV
2008
Springer
15 years 1 months ago
2008
Springer
In this paper we present a framework for identifying the test focus and test objectives based on the assumption that automatic information processing based on encoded meaning is th...
JCC
2008
14 years 11 months ago
2008
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
PAKDD
2009
ACM
15 years 6 months ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
141
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
Web pages are usually highly structured documents. In some documents, content with different functionality is laid out in blocks, some merely supporting the main discourse. In ot...