Sciweavers

331 search results - page 66 / 67
» Comparing Reductions to NP-Complete Sets
Sort
View
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
13 years 11 months ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström
TREC
2008
13 years 8 months ago
Distributed EDLSI, BM25, and Power Norm at TREC 2008
This paper describes our participation in the TREC Legal competition in 2008. Our first set of experiments involved the use of Latent Semantic Indexing (LSI) with a small number of...
April Kontostathis, Andrew Lilly, Raymond J. Spite...
BMCBI
2006
202views more  BMCBI 2006»
13 years 7 months ago
Spectral embedding finds meaningful (relevant) structure in image and microarray data
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
Brandon W. Higgs, Jennifer W. Weller, Jeffrey L. S...
EOR
2007
165views more  EOR 2007»
13 years 7 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang
PAMI
2008
190views more  PAMI 2008»
13 years 7 months ago
Scene Classification Using a Hybrid Generative/Discriminative Approach
We investigate whether dimensionality reduction using a latent generative model is beneficial for the task of weakly supervised scene classification. In detail we are given a set ...
Anna Bosch, Andrew Zisserman, Xavier Muñoz