Sciweavers

2127 search results - page 101 / 426
» Computing large matchings fast
Sort
View
124
Voted
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
223
Voted
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
16 years 3 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
CHI
2002
ACM
16 years 4 months ago
A visual language for sketching large and complex interactive designs
Informal, sketch-based design tools closely match the work practices of user interface designers. Current tools, however, are limited in the size and complexity of interaction tha...
James Lin, Michael Thomsen, James A. Landay
144
Voted
ECCV
2010
Springer
15 years 7 months ago
Detection and Tracking of Large Number of Targets in Wide Area Surveillance
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
146
Voted
ICPR
2008
IEEE
15 years 10 months ago
3D object recognition by fast spherical correlation between combined view EGIs and PFT
This paper proposes a method to recognize 3D object from probed range image under arbitrary pose by fast spherical correlation. First, all view EGIs under different viewpoints are...
Donghui Wang, Hui Qian