Sciweavers

6142 search results - page 860 / 1229
» The Complexity of Partition Functions
Sort
View
JORS
2010
189views more  JORS 2010»
15 years 1 months ago
Monte Carlo scenario generation for retail loan portfolios
Monte Carlo simulation is a common method for studying the volatility of market traded instruments. It is less employed in retail lending, because of the inherent nonlinearities in...
J. L. Breeden, D. Ingram
ICALP
2009
Springer
16 years 7 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
SIGCOMM
2010
ACM
15 years 7 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...
VTC
2010
IEEE
176views Communications» more  VTC 2010»
15 years 5 months ago
Exploiting Redundancy in Iterative H.264 Joint Source and Channel Decoding For Robust Video Transmission
— In this paper we propose joint optimisation of soft-bit assisted iterative joint source and channel decoding with the aid of our proposed EXIT chart optimised redundant source ...
Nasruminallah, Lajos Hanzo
HPCA
2009
IEEE
16 years 7 months ago
Dacota: Post-silicon validation of the memory subsystem in multi-core designs
The number of functional errors escaping design verification and being released into final silicon is growing, due to the increasing complexity and shrinking production schedules ...
Andrew DeOrio, Ilya Wagner, Valeria Bertacco