Sciweavers

49 search results - page 8 / 10
» Computing Inverse ST in Linear Complexity
Sort
View
WSC
2000
13 years 7 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...
AOR
2006
95views more  AOR 2006»
13 years 5 months ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
ICML
2000
IEEE
14 years 6 months ago
On-line Learning for Humanoid Robot Systems
Humanoid robots are high-dimensional movement systems for which analytical system identification and control methods are insufficient due to unknown nonlinearities in the system s...
Gaurav Tevatia, Jörg Conradt, Sethu Vijayakum...
FCCM
2006
IEEE
195views VLSI» more  FCCM 2006»
13 years 11 months ago
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
Andrey Bogdanov, M. C. Mertens
PODC
2003
ACM
13 years 11 months ago
Asynchronous resource discovery
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
Ittai Abraham, Danny Dolev