Sciweavers

1604 search results - page 206 / 321
» Approximation algorithms for developable surfaces
Sort
View
84
Voted
NIPS
2007
15 years 3 months ago
Parallelizing Support Vector Machines on Distributed Computers
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
Edward Y. Chang, Kaihua Zhu, Hao Wang, Hongjie Bai...
WSC
2000
15 years 2 months ago
Variance reduction techniques for value-at-risk with heavy-tailed risk factors
The calculation of value-at-risk (VAR) for large portfolios of complex instruments is among the most demanding and widespread computational challenges facing the financial industr...
Paul Glasserman, Philip Heidelberger, Perwez Shaha...
JMLR
2006
125views more  JMLR 2006»
15 years 1 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
PAMI
2008
160views more  PAMI 2008»
15 years 1 months ago
Parametric Image Alignment Using Enhanced Correlation Coefficient Maximization
In this work, we propose the use of a modified version of the correlation coefficient as a performance criterion for the image alignment problem. The proposed modification has the ...
Georgios D. Evangelidis, Emmanouil Z. Psarakis
TIT
2008
112views more  TIT 2008»
15 years 1 months ago
Rainbow Network Flow of Multiple Description Codes
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
Xiaolin Wu, Bin Ma, Nima Sarshar