Sciweavers

196 search results - page 34 / 40
» Approximating weighted matchings in parallel
Sort
View
78
Voted
TIT
2002
121views more  TIT 2002»
14 years 11 months ago
Asymptotic normality of linear multiuser receiver outputs
This paper proves large-system asymptotic normality of the output of a family of linear multiuser receivers that can be arbitrarily well approximated by polynomial receivers. This ...
Dongning Guo, Sergio Verdú, Lars K. Rasmuss...
ICCV
2009
IEEE
16 years 4 months ago
A Probabilistic Framework for Partial Intrinsic Symmetries in Geometric Data
In this paper, we present a novel algorithm for partial intrinsic symmetry detection in 3D geometry. Unlike previous work, our algorithm is based on a conceptually simple and st...
Ruxandra Lasowski, Art Tevs, Hans-Peter Seidel, Mi...
DATE
2010
IEEE
153views Hardware» more  DATE 2010»
15 years 4 months ago
HORUS - high-dimensional Model Order Reduction via low moment-matching upgraded sampling
— This paper describes a Model Order Reduction algorithm for multi-dimensional parameterized systems, based on a sampling procedure which incorporates a low order moment matching...
Jorge Fernandez Villena, Luis Miguel Silveira
CIKM
2008
Springer
15 years 1 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
ICML
2003
IEEE
16 years 16 days ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington