Sciweavers

5100 search results - page 635 / 1020
» The Linear Complexity of a Graph
Sort
View
WSC
2000
15 years 8 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...
AAAI
1990
15 years 8 months ago
Generalized Shape Autocorrelation
This paper presents an efficient and homogeneous paradigm for automatic acquisition and recognition of nonparametric shapes. Acquisition time varies from linear to cubic in the nu...
Andrea Califano, Rakesh Mohan
195
Voted
ICML
2010
IEEE
15 years 7 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
187
Voted
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
15 years 7 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
GLOBECOM
2008
IEEE
15 years 6 months ago
Power Allocation for Cognitive Radios Based on Primary User Activity in an OFDM System
Efficient and reliable power allocation algorithm in Cognitive radio (CR) networks is a challenging problem. Traditional water-filling algorithm is inefficient for CR networks due ...
Ziaul Hasan, Ekram Hossain, Charles L. Despins, Vi...