#### Filter Results:

- Full text PDF available (27)

#### Publication Year

1997

2017

- This year (5)
- Last 5 years (20)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ahmed El Alaoui, Michael W. Mahoney
- ArXiv
- 2014

One approach to improving the running time of kernel-based machine learning methods is to build a small sketch of the input and use it in lieu of the full kernel matrix in the machine learning task of interest. Here, we describe a version of this approach that comes with running time guarantees as well as improved guarantees on its statistical performance.… (More)

Given a weighted graph with N vertices, consider a real-valued regression problem in a semi-supervised setting, where one observes n labeled vertices, and the task is to label the remaining ones. We present a theoretical study of p-based Laplacian regularization under a d-dimensional geometric random graph model. We provide a variational characterization of… (More)

- Ahmed El Alaoui, Michael W. Mahoney
- NIPS
- 2015

One approach to improving the running time of kernel-based methods is to build a small sketch of the kernel matrix and use it in lieu of the full matrix in the machine learning task of interest. Here, we describe a version of this approach that comes with running time guarantees as well as improved guarantees on its statistical performance. By extending the… (More)

- K. Hafidi, J. Arrington, +20 authors F. Benmokhtar
- 2007

We propose to measure the Beam Spin Asymmetry (BSA) in Deeply Virtual Compton Scattering (DVCS) off 4 He. The measurements will use a 6 GeV polarized electron beam, a 4 He pressurized gas target, the CLAS and the BoNuS RTPC detectors. The major goal of this proposal is to perform the first fully quantitative investigation of the DVCS reaction off a nuclear… (More)

- Timothy Hunter, Ahmed El Alaoui, Alexandre M. Bayen
- ArXiv
- 2014

We present new algorithms for computing the log-determinant of symmetric , diagonally dominant matrices. Existing algorithms run with cubic complexity with respect to the size of the matrix in the worst case. Our algorithm computes an approximation of the log-determinant in time near-linear with respect to the number of non-zero entries and with high… (More)

- A. Fradi, B. Guegan, +6 authors S. Frullani
- 2010

Measuring Deeply Virtual Compton Scattering on a neutron target is one of the necessary steps to complete our understanding of the structure of the nucleon in terms of Generalized Parton Distributions (GPDs). DVCS on a neutron target allows to operate a flavor decomposition of the GPDs and plays a complementary role to DVCS on a transversely polarized… (More)

- Kei Moriya, Reinhard A. Schumacher, +23 authors H. Hakobyan
- 2016

- K. Hafidi, J. Arrington, +35 authors M. Ungaro
- 2008

The proposed measurements are twofold. First, we propose to measure the multiplicities for several hadron species (π + , π − , π 0 , K + , K − , K 0 s) using both hydrogen and deuterium targets. The goal of these measurements is the control of the fragmentation functions used in the extraction of the individual quark and antiquark contributions to the… (More)

- Ahmed El Alaoui
- COLT
- 2016

Given a weighted graph with N vertices, consider a real-valued regression problem in a semi-supervised setting, where one observes n labeled vertices, and the task is to label the remaining ones. We present a theoretical study of ℓ p-based Laplacian regularization under a d-dimensional geometric random graph model. We provide a variational characterization… (More)

- Michael E. McCracken, Curtis A. Meyer, +19 authors M. Khandaker
- 2016

We present a search for ten baryon-number violating decay modes of Λ hyperons using the CLAS detector at Jefferson Laboratory. Nine of these decay modes result in a single meson and single lepton in the final state (Λ → mm) and conserve either the sum or the difference of baryon and lepton number (B ± L). The tenth decay mode (Λ → ¯ pπ +) represents a… (More)