|
Search the dblp DataBase
Malik Magdon-Ismail:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Costas Busch, Malik Magdon-Ismail
Atomic Routing Games on Maximum Congestion. [Citation Graph (0, 0)][DBLP] AAIM, 2006, pp:79-91 [Conf]
- Eric Breimer, Mark K. Goldberg, Brian Kolstad, Malik Magdon-Ismail
Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube. [Citation Graph (0, 0)][DBLP] ALENEX, 2001, pp:161-171 [Conf]
- Malik Magdon-Ismail, Joseph Sill
Using a Linear Fit to Determine Monotonicity Directions. [Citation Graph (0, 0)][DBLP] COLT, 2003, pp:477-491 [Conf]
- Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis
Direct Routing: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP] ESA, 2004, pp:134-145 [Conf]
- Costas Busch, Shailesh Kelkar, Malik Magdon-Ismail
Efficient Bufferless Routing on Leveled Networks. [Citation Graph (0, 0)][DBLP] Euro-Par, 2005, pp:931-940 [Conf]
- Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer
Near-Optimal Hot-Potato Routing on Trees. [Citation Graph (0, 0)][DBLP] Euro-Par, 2004, pp:820-827 [Conf]
- Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele
SDE: Graph Drawing Using Spectral Distance Embedding. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:512-513 [Conf]
- Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2006, pp:30-41 [Conf]
- Jeffrey Baumes, Mark K. Goldberg, Mukkai S. Krishnamoorthy, Malik Magdon-Ismail, Nathan Preston
Finding communities by clustering a graph into overlapping subgraphs. [Citation Graph (0, 0)][DBLP] IADIS AC, 2005, pp:97-104 [Conf]
- Seyit Ahmet Çamtepe, Mark K. Goldberg, Malik Magdon-Ismail, Mukkai Krishn
Detecting conversing groups of chatters: a model, algorithms, and tests. [Citation Graph (0, 0)][DBLP] IADIS AC, 2005, pp:89-96 [Conf]
- Sibel Adali, Brandeis Hill, Malik Magdon-Ismail
The Impact of Ranker Quality on Rank Aggregation Algorithms: Information vs. Robustness. [Citation Graph (0, 0)][DBLP] ICDE Workshops, 2006, pp:37- [Conf]
- Hung-Ching Chen, Malik Magdon-Ismail
NN-OPT: Neural Network for Option Pricing Using Multinomial Tree. [Citation Graph (0, 0)][DBLP] ICONIP (3), 2006, pp:360-369 [Conf]
- Malik Magdon-Ismail, Hung-Ching Chen, Yaser S. Abu-Mostafa
The Multilevel Classification Problem and a Monotonicity Hint. [Citation Graph (0, 0)][DBLP] IDEAL, 2002, pp:410-415 [Conf]
- Costas Busch, Malik Magdon-Ismail, Jing Xi
Optimal Oblivious Path Selection on the Mesh. [Citation Graph (0, 0)][DBLP] IPDPS, 2005, pp:- [Conf]
- Jeffrey Baumes, Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon-Ismail, William A. Wallace, Mohammed Javeed Zaki
Finding Hidden Group Structure in a Stream of Communications. [Citation Graph (0, 0)][DBLP] ISI, 2006, pp:201-212 [Conf]
- Jeffrey Baumes, Mark K. Goldberg, Malik Magdon-Ismail
Efficient Identification of Overlapping Communities. [Citation Graph (0, 0)][DBLP] ISI, 2005, pp:27-36 [Conf]
- Malik Magdon-Ismail, Mark K. Goldberg, William A. Wallace, David Siebecker
Locating Hidden Groups in Communication Networks Using Hidden Markov Models. [Citation Graph (0, 0)][DBLP] ISI, 2003, pp:126-137 [Conf]
- Jon Purnell, Malik Magdon-Ismail, Heidi Jo Newberg
A Probabilistic Approach to Finding Geometric Objects in Spatial Datasets of the Milky Way. [Citation Graph (0, 0)][DBLP] ISMIS, 2005, pp:485-493 [Conf]
- Hung-Ching Chen, Malik Magdon-Ismail
Learning Martingale Measures From High Frequency Financial Data to Help Option Pricing. [Citation Graph (0, 0)][DBLP] JCIS, 2006, pp:- [Conf]
- Mark K. Goldberg, Darren T. Lim, Malik Magdon-Ismail
A learning algorithm for string assembly. [Citation Graph (0, 0)][DBLP] BIOKDD, 2001, pp:31-37 [Conf]
- Zehra Cataltepe, Malik Magdon-Ismail
Incorporating Test Inputs into Learning. [Citation Graph (0, 0)][DBLP] NIPS, 1997, pp:- [Conf]
- Malik Magdon-Ismail, Amir F. Atiya
Neural Networks for Density Estimation. [Citation Graph (0, 0)][DBLP] NIPS, 1998, pp:522-528 [Conf]
- Costas Busch, Malik Magdon-Ismail, Jing Xi
Oblivious routing on geometric networks. [Citation Graph (0, 0)][DBLP] SPAA, 2005, pp:316-324 [Conf]
- Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy
Cake-Cutting Is Not a Piece of Cake. [Citation Graph (0, 0)][DBLP] STACS, 2003, pp:596-607 [Conf]
- Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
Universal Bufferless Routing. [Citation Graph (0, 0)][DBLP] WAOA, 2004, pp:239-252 [Conf]
- Costas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener
Contention-Free MAC Protocols for Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP] DISC, 2004, pp:245-259 [Conf]
- Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismail
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:513-523 [Conf]
- Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis
Direct Routing: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:45, n:1, pp:45-68 [Journal]
- Costas Busch, Mukkai S. Krishnamoorthy, Malik Magdon-Ismail
Hardness Results for Cake Cutting. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 2005, v:86, n:, pp:85-106 [Journal]
- Victor Boyarshinov, Malik Magdon-Ismail
Linear time isotonic and unimodal regression in the L1 and Linfinity norms. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2006, v:4, n:4, pp:676-691 [Journal]
- Zehra Cataltepe, Yaser S. Abu-Mostafa, Malik Magdon-Ismail
No Free Lunch for Early Stopping. [Citation Graph (0, 0)][DBLP] Neural Computation, 1999, v:11, n:4, pp:995-1009 [Journal]
- Malik Magdon-Ismail
No Free Lunch for Noise Prediction. [Citation Graph (0, 0)][DBLP] Neural Computation, 2000, v:12, n:3, pp:547-564 [Journal]
- Malik Magdon-Ismail, Amir F. Atiya
The Early Restart Algorithm. [Citation Graph (0, 0)][DBLP] Neural Computation, 2000, v:12, n:6, pp:1303-1312 [Journal]
- Jeffrey Baumes, Mark K. Goldberg, Mykola Hayvanovych, Stephen Kelley, Malik Magdon-Ismail, Konstantin Mertsalov, William A. Wallace
SIGHTS: A Software System for Finding Coalitions and Leaders in a Social Network. [Citation Graph (0, 0)][DBLP] ISI, 2007, pp:193-199 [Conf]
- Jeffrey Baumes, Mark K. Goldberg, Malik Magdon-Ismail, William A. Wallace
Discovering Hidden Groups in Communication Networks. [Citation Graph (0, 0)][DBLP] ISI, 2004, pp:378-389 [Conf]
- Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Ismail
Identifying Multi-ID Users in Open Forums. [Citation Graph (0, 0)][DBLP] ISI, 2004, pp:176-186 [Conf]
- Sibel Adali, Tina Liu, Malik Magdon-Ismail
Optimal Link Bombs are Uncoordinated. [Citation Graph (0, 0)][DBLP] AIRWeb, 2005, pp:58-69 [Conf]
- Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
Efficient bufferless packet switching on trees and leveled networks. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2007, v:67, n:11, pp:1168-1186 [Journal]
- Bülent Yener, Malik Magdon-Ismail, Fikret Sivrikaya
Joint problem of power optimal connectivity and coverage in wireless sensor networks. [Citation Graph (0, 0)][DBLP] Wireless Networks, 2007, v:13, n:4, pp:537-550 [Journal]
Validating Evolutionary Algorithms on Volunteer Computing Grids. [Citation Graph (, )][DBLP]
Distributed and Generic Maximum Likelihood Evaluation. [Citation Graph (, )][DBLP]
Learning What Makes a Society Tick. [Citation Graph (, )][DBLP]
Discover the power of social and hidden curriculum to decision making: experiments with enron email and movie newsgroups. [Citation Graph (, )][DBLP]
Learning American English Accents Using Ensemble Learning with GMMs. [Citation Graph (, )][DBLP]
Reverse Engineering an Agent-Based Hidden Markov Model for Complex Social Systems. [Citation Graph (, )][DBLP]
Approximating the Covariance Matrix of GMMs with Low-Rank Perturbations. [Citation Graph (, )][DBLP]
Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD. [Citation Graph (, )][DBLP]
A Generative Model for Statistical Determination of Information Content from Conversation Threads. [Citation Graph (, )][DBLP]
A locality model of the evolution of blog networks. [Citation Graph (, )][DBLP]
Communication Dynamics of Blog Networks. [Citation Graph (, )][DBLP]
Adapting to a Market Shock: Optimal Sequential Market-Making. [Citation Graph (, )][DBLP]
Accelerating the MilkyWay@Home Volunteer Computing Project with GPUs. [Citation Graph (, )][DBLP]
A Permutation Approach to Validation. [Citation Graph (, )][DBLP]
Collective wisdom: information growth in wikis and blogs. [Citation Graph (, )][DBLP]
Pricing the American Option Using Reconfigurable Hardware. [Citation Graph (, )][DBLP]
Stable Statistics of the Blogograph. [Citation Graph (, )][DBLP]
Models of Communication Dynamics for Simulation of Information Diffusion. [Citation Graph (, )][DBLP]
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix [Citation Graph (, )][DBLP]
Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound [Citation Graph (, )][DBLP]
Contention-free MAC protocols for asynchronous wireless sensor networks. [Citation Graph (, )][DBLP]
Search in 0.133secs, Finished in 0.135secs
|