1129 search results - page 94 / 226 » Modular Ranking Abstraction |
146
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Query expansion is a well known method to improve the performance of information retrieval systems. In this work we have tested different approaches to extract the candid...
166
click to vote
IPM
2006
15 years 6 months ago
2006
A methodology for automatically identifying and clustering semantic features or topics in a heterogeneous text collection is presented. Textual data is encoded using a low rank no...
199
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present a novel approach for classification using a discretised function representation which is independent of the data locations. We construct the classifier as a su...
218
click to vote
ICANN
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper studies a risk minimization approach to estimate a transformation model from noisy observations. It is argued that transformation models are a natural candidat...