Sciweavers

346 search results - page 49 / 70
» A New Approximate Maximal Margin Classification Algorithm
Sort
View
IJCNN
2000
IEEE
13 years 12 months ago
Metrics that Learn Relevance
We introduce an algorithm for learning a local metric to a continuous input space that measures distances in terms of relevance to the processing task. The relevance is defined a...
Samuel Kaski, Janne Sinkkonen
WWW
2007
ACM
14 years 8 months ago
Efficient search engine measurements
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...
Ziv Bar-Yossef, Maxim Gurevich
STACS
2010
Springer
14 years 2 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
JMLR
2008
209views more  JMLR 2008»
13 years 7 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
TIT
2010
155views Education» more  TIT 2010»
13 years 2 months ago
On the capacity achieving covariance matrix for Rician MIMO channels: an asymptotic approach
In this contribution, the capacity-achieving input covariance matrices for coherent blockfading correlated MIMO Rician channels are determined. In contrast with the Rayleigh and u...
Julien Dumont, Walid Hachem, Samson Lasaulce, Phil...