Sciweavers

6045 search results - page 353 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
JCSS
2010
112views more  JCSS 2010»
15 years 6 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
BMVC
2010
15 years 5 months ago
Generalized RBF feature maps for Efficient Detection
Kernel methods yield state-of-the-art performance in certain applications such as image classification and object detection. However, large scale problems require machine learning...
Sreekanth Vempati, Andrea Vedaldi, Andrew Zisserma...
CVPR
2011
IEEE
2153views Computer Vision» more  CVPR 2011»
15 years 3 months ago
The Light-Path Less Traveled
This paper extends classical object pose and relative camera motion estimation algorithms for imaging sensors sampling the scene through light-paths. Many algorithms in multi-view...
Srikumar Ramalingam, Sofien Bouaziz, Peter Sturm, ...
CORR
2011
Springer
151views Education» more  CORR 2011»
15 years 2 months ago
Sparsity Enhanced Decision Feedback Equalization
For single-carrier systems with frequency domain equalization, decision feedback equalization (DFE) performs better than linear equalization and has much lower computational compl...
Jovana Ilic, Thomas Strohmer
CISS
2010
IEEE
14 years 11 months ago
Unconstrained minimization of quadratic functions via min-sum
—Gaussian belief propagation is an iterative algorithm for computing the mean of a multivariate Gaussian distribution. Equivalently, the min-sum algorithm can be used to compute ...
Nicholas Ruozzi, Sekhar Tatikonda