Sciweavers

2192 search results - page 224 / 439
» Algorithms for Challenging Motif Problems
Sort
View
JSS
2007
120views more  JSS 2007»
15 years 3 months ago
The design and evaluation of path matching schemes on compressed control flow traces
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
Yongjing Lin, Youtao Zhang, Rajiv Gupta
FS
2010
95views more  FS 2010»
15 years 2 months ago
Pricing credit derivatives under incomplete information: a nonlinear-filtering approach
This paper considers a general reduced form pricing model for credit derivatives where default intensities are driven by some factor process X. The process X is not directly observ...
Rüdiger Frey, Wolfgang Runggaldier
CORR
2011
Springer
186views Education» more  CORR 2011»
14 years 11 months ago
Similarity Join Size Estimation using Locality Sensitive Hashing
Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector similarity join size estimation (VSJ). It is a generali...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
TMI
2010
164views more  TMI 2010»
14 years 10 months ago
Robust Reconstruction of MRSI Data Using a Sparse Spectral Model and High Resolution MRI Priors
We introduce a novel algorithm to address the challenges in magnetic resonance (MR) spectroscopic imaging. In contrast to classical sequential data processing schemes, the proposed...
Ramin Eslami, Mathews Jacob
CVPR
2011
IEEE
14 years 7 months ago
Multi-label Learning with Incomplete Class Assignments
We consider a special type of multi-label learning where class assignments of training examples are incomplete. As an example, an instance whose true class assignment is (c1, c2, ...
Serhat Bucak, Rong Jin, Anil Jain