1403 search results - page 162 / 281 » About Approximations of Exponentials |
172
click to vote
IIS
2003
15 years 7 months ago
2003
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
146
Voted
4OR
2010
15 years 6 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
188
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...
194
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
185
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with th...