Sciweavers

7228 search results - page 427 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ASUNAM
2010
IEEE
15 years 8 months ago
Fast Discovery of Reliable Subnetworks
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon
WSC
2004
15 years 8 months ago
Efficient Pricing of Barrier Options with the Variance-Gamma Model
We develop an efficient Monte Carlo algorithm for pricing barrier options with the variance gamma model (Madan, Carr, and Chang 1998). After generalizing the double-gamma bridge s...
Athanassios N. Avramidis
AAAI
1997
15 years 8 months ago
Reinforcement Learning with Time
This paper steps back from the standard infinite horizon formulation of reinforcement learning problems to consider the simpler case of finite horizon problems. Although finite ho...
Daishi Harada
EMNLP
2010
15 years 4 months ago
Minimum Error Rate Training by Sampling the Translation Lattice
Minimum Error Rate Training is the algorithm for log-linear model parameter training most used in state-of-the-art Statistical Machine Translation systems. In its original formula...
Samidh Chatterjee, Nicola Cancedda
MICCAI
2007
Springer
16 years 7 months ago
De-enhancing the Dynamic Contrast-Enhanced Breast MRI for Robust Registration
Abstract. Dynamic enhancement causes serious problems for registration of contrast enhanced breast MRI, due to variable uptakes of agent on different tissues or even same tissues i...
Yuanjie Zheng, Jingyi Yu, Chandra Kambhamettu, Sar...