Sciweavers

2004 search results - page 161 / 401
» Sampling from large graphs
Sort
View
IOR
2008
126views more  IOR 2008»
15 years 3 months ago
Fast Simulation of Multifactor Portfolio Credit Risk
This paper develops rare event simulation methods for the estimation of portfolio credit risk -- the risk of losses to a portfolio resulting from defaults of assets in the portfol...
Paul Glasserman, Wanmo Kang, Perwez Shahabuddin
IROS
2006
IEEE
162views Robotics» more  IROS 2006»
15 years 9 months ago
Efficiency Improvement in Monte Carlo Localization through Topological Information
- Monte Carlo localization is known to be one of the most reliable methods for pose estimation of a mobile robot. Many studies have been conducted to improve performance of MCL. Al...
Tae-Bum Kwon, Ju-Ho Yang, Jae-Bok Song, Woojin Chu...
PAMI
2007
127views more  PAMI 2007»
15 years 2 months ago
Stereo Correspondence with Occlusion Handling in a Symmetric Patch-Based Graph-Cuts Model
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
Yi Deng, Qiong Yang, Xueyin Lin, Xiaoou Tang
ICPPW
2005
IEEE
15 years 9 months ago
A Comparison of Two Methods for Building Astronomical Image Mosaics on a Grid
This paper compares two methods for running an application composed of a set of modules on a grid. The set of modules (collectively called Montage) generates large astronomical im...
Daniel S. Katz, Joseph C. Jacob, G. Bruce Berriman...
ICDM
2008
IEEE
168views Data Mining» more  ICDM 2008»
15 years 9 months ago
Measuring Proximity on Graphs with Side Information
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
Hanghang Tong, Huiming Qu, Hani Jamjoom