Sciweavers

6110 search results - page 349 / 1222
» Approximate Computing
Sort
View
ECCV
2008
Springer
16 years 8 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
COMPGEOM
2004
ACM
16 years 4 days ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount
ICC
2007
IEEE
117views Communications» more  ICC 2007»
16 years 1 months ago
On the Fade Duration Distribution in Nakagami Fading Channels
− During almost fifty years the Fade Duration Distribution (FDD) of random signals has been an open research topic. However, for Nakagami fading channels, and in general for the ...
A. F. Ramos-Alarcón, Valeri Ya. Kontorovitc...
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
15 years 8 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
164
Voted
CVPR
2008
IEEE
16 years 8 months ago
Classification using intersection kernel support vector machines is efficient
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can ...
Subhransu Maji, Alexander C. Berg, Jitendra Malik