- A Maximum Likelihood Approach to Volatility Estimation for a Brownian Motion Using the High, Low and Close
- An Analysis of the Maximum Drawdown Risk Malik Magdon-Ismail
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- UNIVERSAL BUFFERLESS PACKET SWITCHING # COSTAS BUSCH + , MALIK MAGDONISMAIL # , AND MARIOS MAVRONICOLAS
- Optimal Link Bombs are Uncoordinated # Sibel Adal, Tina Liu, Malik MagdonIsmail
- Inferring Agent Dynamics from Social Communication HungChing (Justin)
- Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent
- Incorporating Test Inputs into Learning Zehra Cataltepe
- EXPLOVA: Choice of Regularization Parameters by Explanation of Variance
- Optimal Oblivious Path Selection on the Mesh Costas Busch Malik MagdonIsmail Jing Xi
- SDE: Graph Drawing Using Spectral Distance (Long Theory Paper)
- ANALYZING THE IMPORTANCE OF GROUP STRUCTURE IN THE GOOGLE PAGERANK
- A PROBABILISTIC APPROACH TO FINDING GEOMETRIC OBJECTS IN SPATIAL DATASETS OF
- MACHINE LEARNING IN COMPUTATIONAL FINANCE
- SIGHTS: A Software System for Finding Coalitions and Leaders in a Social Network
- Statistical Modeling of Social Groups on Communication Networks Mark Goldberg
- Compressing Protein Conformational Space Malik Magdon-Ismail Yu Shao y Daniel Freedman z
- FE2707 Expected value/mathematical expectation 1 FE2707 Expected value/mathematical expectation
- Optimal Oblivious Path Selection on the Mesh Costas Busch, Member, IEEE, Malik Magdon-Ismail, Member, IEEE, Jing Xi
- Efficient Computation of Optimal Trading Strategies Victor Boyarshinov
- On the Maximum Drawdown of a Brownian Motion Malik Magdon-Ismail Amir F. Atiya
- DISTANCE MATRIX RECONSTRUCTION FROM INCOMPLETE DISTANCE INFORMATION FOR SENSOR NETWORK LOCALIZATION
- Linear Time Isotonic and Unimodal Regression in the L1 and L Norms
- No Free Lunch For Noise Prediction Malik MagdonIsmail
- Oblivious Routing on Geometric Networks Costas Busch
- Direct Routing: Algorithms and Complexity Costas Busch 1 , Malik MagdonIsmail 1 , Marios Mavronicolas 2 , and Paul
- E#cient Identification of Overlapping Communities #
- Identification of Hidden Groups in Communications # J. Baumes M. Goldberg M. MagdonIsmail W. Wallace
- A Generalization Model for Learning Yaser S. AbuMostafa
- A Locality Model of the Evolution of Blog Networks Mark Goldberg, Malik Magdon-Ismail, Stephen Kelley, Konstantin Mertsalov
- Locating Hidden Groups in Communication Networks Using Hidden Markov Models
- Effectiveness of Information Retraction Cindy Hui, Malik Magdon-Ismail, Mark Goldberg and William A. Wallace
- Int. J. Data Mining and Bioinformatics, Vol. 3, No. 1, 115 1 Approximating the Covariance Matrix of GMMs
- Hardness Results for Cake Cutting Costas Busch Mukkai S. Krishnamoorthy Malik Magdon-Ismail
- NearOptimal HotPotato Routing on Trees Costas Busch 1 , Malik MagdonIsmail 1 , Marios Mavronicolas 2 , and Roger
- Direct Routing: Algorithms and Complexity # Costas Busch + Malik MagdonIsmail # Marios Mavronicolas
- Consistent Density Estimation from Distribution Functions Malik MagdonIsmail \Lambda
- ContentionFree MAC protocols for Wireless Sensor Networks
- Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of
- Distance Matrix Reconstruction from Incomplete Distance Information for Sensor Network
- Pricing the American Option using Reconfigurable Hardware
- Modeling the Cultural Subjectivity: Towards Computational Critique? #
- Atomic Routing Games on Maximum Congestion Costas Busch
- The Multilevel Classi cation Problem and a Monotonicity Hint
- Power Optimal Connectivity and Coverage in Wireless Sensor Networks
- Extract Agent-based Model from Social Communication Network Hung-Ching (Justin) Chen
- A Probabilistic Approach to Finding Geometric Objects in Spatial Datasets of the Milky Way
- Cake-Cutting is Not a Piece of Cake Malik Magdon-Ismail, Costas Busch, and Mukkai S. Krishnamoorthy
- SDE: Graph Drawing Using Spectral Distance Embedding #
- On Hidden Groups in Communication Networks # J. Baumes M. Goldberg M. MagdonIsmail W. Wallace
- Volatility Estimation Using High, Low, and Close Data --
- Pricing the Quality Option for the Bond Futures Contract in a Multifactor Vasicek Framework
- Approximating the Covariance Matrix with Low-rank Perturbations
- Universal Bufferless Routing Costas Busch1
- The Maximum Drawdown of the Brownian Motion Malik Magdon-Ismail
- On the height of a random set of points in a d-dimensional unit cube
- MAXIMUM LIKELIHOOD FITTING OF TIDAL STREAMS WITH APPLICATION TO THE SAGITTARIUS DWARF TIDAL TAILS
- Discovering Hidden Groups in Communication J. Baumes, M. Goldberg, M. Magdon-Ismail, and W. Wallace
- Optimal Link Bombs are Uncoordinated Sibel Adali, Tina Liu, Malik Magdon-Ismail
- Learning Martingale Measures From High Frequency Financial Data to Help Option Pricing
- NN-OPT: Neural Network for Option Pricing Using Multinomial Tree
- Linear Time Isotonic and Unimodal Regression in the L 1 and L# Norms
- FE2713 Ordinary Least Squares (OLS) 1 FE2713 Ordinary Least Squares (OLS)
- A Linear Fit Gets the Correct Monotonicity Directions # Malik MagdonIsmail
- Discovering Hidden Groups in Communication J. Baumes, M. Goldberg, M. MagdonIsmail, and W. Wallace
- Atomic Routing Games on Maximum Costas Busch and Malik MagdonIsmail
- Joint Problem of Power Optimal Connectivity and Coverage in Wireless Sensor Networks
- SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
- On Hidden Groups in Communication Networks J. Baumes M. Goldberg M. Magdon-Ismail W. Wallace
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Optimal Oblivious Routing in Hole-Free Costas Busch1
- International Journal of Foundations of Computer Science # World Scientific Publishing Company
- A Linear Fit Gets the Correct Monotonicity Directions Malik Magdon-Ismail
- A Learning Algorithm for String Assembly Mark K. Goldberg
- Identifying MultiID Users in Open Forums # HungChing Chen, Mark Goldberg, and Malik MagdonIsmail
- Universal Bu#erless Routing Costas Busch 1 , Malik MagdonIsmail 1 , and Marios Mavronicolas 2
- Atomic Routing Games on Maximum Congestion Costas Busch
- $%"" " &!"' (') % " 0! 12345 126789@ABC243
- Permutation Complexity Bound on Out-Sample Error Malik Magdon-Ismail
- SUBMITTED TO IEEE TASE REGULAR PAPER 1 Sensor Selection in Arbitrary Dimensions
- Measuring Similarity between Sets of Overlapping Mark K. Goldberg, Mykola Hayvanovych and Malik Magdon-Ismail
- Direct Routing: Algorithms and Complexity Costas Busch1
- ALGORITHMS FOR FINDING HIDDEN GROUPS AND THEIR STRUCTURE FROM THE STREAMING
- A Permutation Approach to Validation Malik Magdon-Ismail
- E#cient Bu#erless Routing on Leveled Networks Costas Busch, Shailesh Kelkar, and Malik MagdonIsmail
- Detecting Conversing Groups of Chatters: A Model, Algorithms, and Tests Seyit Ahmet C amtepe
- Detecting Conversing Groups of Chatters: A Model, Algorithms, and Tests Seyit Ahmet Camtepe
- Accelerating the MilkyWay@Home volunteer computing project with GPUs
- A Probabilistic Approach to Finding Geometric Objects in Spatial Datasets of the Milky Way
- FE2709 Maximum Likelihood Estimation (MLE) 1 FE2709 Maximum Likelihood Estimation (MLE)
- E#cient Optimal Linear Boosting of A Pair of Classifiers Victor Boyarshinov Malik MagdonIsmail
- Using A Linear Fit To Determine Monotonicity Malik Magdon-Ismail 1 and Joseph Sill 2
- !#"%$&('0)2134576849@ACB@49DFEGGHIP Q 49RSA"TUVF"XWY$&`6a"TUA49cbd"%Pefg7E3A"ihXqpV49Ig
- Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magdon-Ismail Jing Xi
- ASAND: Asynchronous Slot Assignment and Neighbor Discovery Protocol for Wireless Networks
- Learning Martingale Measures to Price Options Hung-Ching (Justin) Chen
- On the Diversity Within Internet Search Engines: A Clustering Approach Using Query Based Metrics
- Dynamics of Bridging and Bonding in Social Groups: A Multi-Agent Model
- Prior Information as a Natural Path to Regularization Malik MagdonIsmail
- Joint Problem of Power Optimal Connectivity and Coverage in Wireless Sensor Networks
- The Impact of Ranker Quality on Rank Aggregation Sibel Adal, Brandeis Hill, Malik MagdonIsmail
- Compression of Protein Conformational Space Yu Shao 1 , Malik Magdon-Ismail 2 , Daniel Freedman 2 , Srinivas Akella 2 ,
- Pricing the American Put Using A New Class of Tight Lower Bounds Malik MagdonIsmail
- Direct Routing: Algorithms and Complexity Costas Busch
- Noname manuscript No. (will be inserted by the editor)
- SDE: Graph Drawing Using Spectral Distance Ali Civril, Malik Magdon-Ismail and Eli Bocek-Rivele
- AN EVALUATION OF A STATISTICAL FRAMEWORK AND ALGORITHMS FOR ADAPTIVE AGGREGATION
- E#cient Computation of Optimal Trading Strategies Victor Boyarshinov
- Finding Hidden Group Structure in a Stream of Communications #
- Finding Communities by Clustering a Graph into Overlapping Subgraphs #
- DENSITY ESTIMATION AND RANDOM VARIATE GENERATION USING MULTILAYER NETWORKS \Lambda
- The Equivalent Martingale Measure: An Introduction to Pricing Using Expectations
- A Maximum Likelihood Approach to Variance Estimation for a Brownian Motion Using the High, Low and Close
- Regularization in Generalized Linear Malik MagdonIsmail \Lambda
- Experimental Evaluation of the Height of a Random Set of Points in a d-dimensional Cube
- Discovering Hidden Groups in Communication Networks1
- Contention-Free MAC protocols for Wireless Sensor Networks
- REVERSE ENGINEERING A HIDDEN MARKOV MODEL FOR COMPLEX SOCIAL SYSTEMS
- ThirdInternationalConference onIntelligentDataEngineering
- Discovering Hidden Groups in Communication Networks 1
- An Analysis of the Maximum Drawdown Risk Malik MagdonIsmail
- SUBMITTED TO IEEE TASE --REGULAR PAPER 1 Sensor Selection in Arbitrary Dimensions
- On the Maximum Drawdown of a Brownian Motion Malik MagdonIsmail Amir F. Atiya
- Modeling the Cultural Subjectivity: Towards Computational Critique?
- Pricing the American Put Using A New Class of Tight Lower Bounds Malik Magdon-Ismail
- J. Parallel Distrib. Comput. 67 (2007) 11681186 www.elsevier.com/locate/jpdc
- UNIVERSAL BUFFERLESS PACKET SWITCHING COSTAS BUSCH, MALIK MAGDON-ISMAIL, AND MARIOS MAVRONICOLAS
- APPROXIMATING COVARIANCE MATRICES USING LOW RANK PERTURBATIONS
- Automated News Analysis Julia Sarayeva
- ESTIMATION OF CREDIT AND INTEREST RATE RISKS FOR LOAN PORTFOLIOS
- COLUMN SUBSET SELECTION FOR APPROXIMATING DATA MATRICES
- MACHINE LEARNING IN COMPUTATIONAL FINANCE
- A PROBABILISTIC APPROACH TO FINDING GEOMETRIC OBJECTS IN SPATIAL DATASETS OF
- ANALYZING THE IMPORTANCE OF GROUP STRUCTURE IN THE GOOGLE PAGERANK
- A HIDDEN MARKOV MODEL FOR DESCRIBING THE STATISTICAL EVOLUTION OF SOCIAL GROUPS
- Pier Reviewed Journals [1] Victor Boyarshinov and Malik Magdon-Ismail. Efficient computation of optimal trading strategies.
- Prominence Ranking in Graphs with Community Structure
- A Permutation Approach to Validation Malik Magdon-Ismail
- Measuring Behavioral Trust in Social Networks Sibel Adali, Robert Escriva, Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon-Ismail,
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Atomic Routing Games on Maximum Costas Busch and Malik Magdon-Ismail
- Learning American English Accents Using Ensemble Learning with GMMs Jonathan T. Purnell
- Distributed and Generic Maximum Likelihood Evaluation Travis Desell Nathan Cole Malik Magdon-Ismail Heidi Newberg
- Collective Wisdom: Information Growth in Wikis and Blogs Sanmay Das and Malik Magdon-Ismail
- Discovery, Analysis and Monitoring of Hidden Social Networks and Their Evolution
- Efficient Bufferless Routing on Leveled Networks Costas Busch, Shailesh Kelkar, and Malik Magdon-Ismail
- Near-Optimal Hot-Potato Routing on Trees Costas Busch1
- Information vs. Robustness in Rank Aggregation: Models, Algorithms and a Statistical Framework for
- Identification of Hidden Groups in Communications J. Baumes M. Goldberg M. Magdon-Ismail W. Wallace
- Efficient Optimal Linear Boosting of A Pair of Classifiers Victor Boyarshinov Malik Magdon-Ismail
- SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
- The Impact of Ranker Quality on Rank Aggregation Algorithms: Information vs. Robustness
- HARDNESS RESULTS FOR CAKE CUTTING Costas Busch Mukkai S. Krishnamoorthy Malik Magdon-Ismail
- Oblivious Routing on Geometric Networks Costas Busch
- Finding Communities by Clustering a Graph into Overlapping anonymous submission
- Power Optimal Connectivity and Coverage in Wireless Sensor Networks
- The Impact of Ranker Quality on Rank Aggregation Sibel Adali, Brandeis Hill, Malik Magdon-Ismail
- Robust Asynchronous Optimization for Volunteer Computing Grids Travis Desell, Malik Magdon-Ismail, Boleslaw Szymanski, Carlos Varela, Heidi Newberg and Nathan Cole
- A Model for Information Growth in Collective Wisdom Processes SANMAY DAS, Rensselaer Polytechnic Institute
- Toward Efficient Search for a Fragment Network in a Large Semantic Database
- SSDE-Cluster: Fast Overlapping Clustering of Networks Using Sampled Spectral Distance
- Oblivious Routing for Sensor Network Costas Busch and Malik Magdon-Ismail and Jing Xi
- Aborting a Message Flowing Through Social Communities
- Evolutionary Algorithms on Volunteer Computing Platforms: The
- April 9, 2008 12:41 SPC/INSTRUCTION FILE IJNS08
- Actions Speak as Loud as Words: Predicting Relationships from Social Behavior Data
- Column Subset Selection via Sparse Approximation of SVD A.Civrila,
