Biblio
Export 68 results:
Author Title Type [ Year] Filters: First Letter Of Last Name is V [Clear All Filters]
“Robust full-waveform inversion using the Student's t-distribution”, in SEG Technical Program Expanded Abstracts, 2011, vol. 30, pp. 2669-2673.
, “Robust FWI using Student's t-distribution”, in ICIAM, 2011.
, “SINBAD's research program”, presented at the 11, 2011.
, “Sparsity promoting formulations and algorithms for FWI”, in EAGE Annual Conference Proceedings, 2011.
, “Sparsity promoting formulations and algorithms for FWI”, in ICIAM, 2011.
, “Comparison of standard adaptive subtraction and primary-multiple separation in the curvelet domain”, in EAGE Annual Conference Proceedings, 2010.
, “Optimizing costly functions with simple constraints: a limited-memory projected Quasi-Newton algorithm”, in SLIM, 2009, vol. 12.
, “Spot: A linear-operator toolbox for Matlab”, in SCAIM, University of British Columbia, 2009.
, “Exact sparse reconstruction and neighbourly polytopes”, in IAM, 2008.
, “Sparco: A testing framework for sparse reconstruction”, in SINBAD 2008, 2008.
, “In pursuit of a root”, presented at the 07, 2007.
, “In pursuit of a root”, in 2007 Von Neumann Symposium, 2007.
, “Multiterm multiple prediction using separated reflections and diffractions combined with curvelet-based subtraction”, in SEG Technical Program Expanded Abstracts, 2007, vol. 26, pp. 2535-2539.
, “Primary-multiple separation by curvelet frames”, in SINBAD 2006, 2006, vol. 170, pp. 781-799.
, “Robust curvelet-domain primary-multiple separation with sparseness constraints”, in EAGE Annual Conference Proceedings, 2005.
, “Curvelet imaging and processing: adaptive multiple elimination”, in CSEG Annual Conference Proceedings, 2004.
, “Curvelet-domain multiple elimination with sparseness constraints”, in SEG Technical Program Expanded Abstracts, 2004, vol. 23, pp. 1333-1336.
, “Separation of primaries and multiples by non-linear estimation in the curvelet domain”, in EAGE Annual Conference Proceedings, 2004.
, Pages
- « first
- ‹ previous
- 1
- 2
- 3