The following pages link to Malik Magdon-Ismail (Q441842):
Displayed 47 items.
- An analysis of optimal link bombs (Q441843) (← links)
- Embedding a forest in a graph (Q540102) (← links)
- (Q764371) (redirect page) (← links)
- Column subset selection via sparse approximation of SVD (Q764372) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- Linear time isotonic and unimodal regression in the \(L_{1}\) and \(L_{\infty }\) norms (Q866553) (← links)
- A linear fit gets the correct monotonicity directions (Q1009229) (← links)
- On selecting a maximum volume sub-matrix of a matrix and related problems (Q1034598) (← links)
- Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
- NP-hardness and inapproximability of sparse PCA (Q2361497) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- Contention-free MAC protocols for asynchronous wireless sensor networks (Q2377249) (← links)
- Feature selection for linear SVM with provable guarantees (Q2417820) (← links)
- A note on sparse least-squares regression (Q2446076) (← links)
- Efficient bufferless packet switching on trees and leveled networks (Q2455398) (← links)
- The Fast Cauchy Transform and Faster Robust Linear Regression (Q2812147) (← links)
- Defining and Discovering Communities in Social Networks (Q2913781) (← links)
- On the Height of a Random Set of Points in a d-Dimensional Unit Cube (Q3146574) (← links)
- (Q3396559) (← links)
- Universal Bufferless Packet Switching (Q3519391) (← links)
- Evolutionary Algorithms on Volunteer Computing Platforms: The MilkyWay@Home Project (Q3557782) (← links)
- SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding (Q3595496) (← links)
- Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD (Q3596737) (← links)
- (Q4418684) (← links)
- Optimal Oblivious Path Selection on the Mesh (Q4589579) (← links)
- Recovering PCA from Hybrid-$(\ell_1,\ell_2)$ Sparse Sampling of Data Elements (Q4636984) (← links)
- A maximum likelihood approach to volatility estimation for a Brownian motion using high, low and close price data (Q4647284) (← links)
- (Q4708030) (← links)
- (Q4801189) (← links)
- On the maximum drawdown of a Brownian motion (Q4819444) (← links)
- A permutation approach to validation* (Q4969738) (← links)
- Learning Theory and Kernel Machines (Q5305871) (← links)
- Euro-Par 2004 Parallel Processing (Q5311348) (← links)
- Near-Optimal Coresets for Least-Squares Regression (Q5346331) (← links)
- Deterministic Feature Selection for K-Means Clustering (Q5346350) (← links)
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces (Q5373926) (← links)
- Oblivious Routing for Sensor Network Topologies (Q5391122) (← links)
- (Q5405231) (← links)
- Atomic Routing Games on Maximum Congestion (Q5434384) (← links)
- Contention-Free MAC Protocols for Wireless Sensor Networks (Q5464195) (← links)
- Algorithms – ESA 2004 (Q5464573) (← links)
- Near-Optimal Column-Based Matrix Reconstruction (Q5494935) (← links)
- Near Optimal Column-Based Matrix Reconstruction (Q5495020) (← links)
- Experimental and Efficient Algorithms (Q5710051) (← links)
- Approximation and Online Algorithms (Q5713441) (← links)
- Graph Drawing (Q5897655) (← links)
- Spreading Processes and Large Components in Ordered, Directed Random Graphs (Q6235566) (← links)