The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Malik Magdon-Ismail: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Costas Busch, Malik Magdon-Ismail
    Atomic Routing Games on Maximum Congestion. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:79-91 [Conf]
  2. 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]
  3. Malik Magdon-Ismail, Joseph Sill
    Using a Linear Fit to Determine Monotonicity Directions. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:477-491 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. Costas Busch, Malik Magdon-Ismail, Jing Xi
    Optimal Oblivious Path Selection on the Mesh. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  15. 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]
  16. Jeffrey Baumes, Mark K. Goldberg, Malik Magdon-Ismail
    Efficient Identification of Overlapping Communities. [Citation Graph (0, 0)][DBLP]
    ISI, 2005, pp:27-36 [Conf]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. Zehra Cataltepe, Malik Magdon-Ismail
    Incorporating Test Inputs into Learning. [Citation Graph (0, 0)][DBLP]
    NIPS, 1997, pp:- [Conf]
  22. Malik Magdon-Ismail, Amir F. Atiya
    Neural Networks for Density Estimation. [Citation Graph (0, 0)][DBLP]
    NIPS, 1998, pp:522-528 [Conf]
  23. Costas Busch, Malik Magdon-Ismail, Jing Xi
    Oblivious routing on geometric networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:316-324 [Conf]
  24. 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]
  25. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
    Universal Bufferless Routing. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:239-252 [Conf]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. Sibel Adali, Tina Liu, Malik Magdon-Ismail
    Optimal Link Bombs are Uncoordinated. [Citation Graph (0, 0)][DBLP]
    AIRWeb, 2005, pp:58-69 [Conf]
  38. 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]
  39. 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]

  40. Validating Evolutionary Algorithms on Volunteer Computing Grids. [Citation Graph (, )][DBLP]


  41. Distributed and Generic Maximum Likelihood Evaluation. [Citation Graph (, )][DBLP]


  42. Learning What Makes a Society Tick. [Citation Graph (, )][DBLP]


  43. Discover the power of social and hidden curriculum to decision making: experiments with enron email and movie newsgroups. [Citation Graph (, )][DBLP]


  44. Learning American English Accents Using Ensemble Learning with GMMs. [Citation Graph (, )][DBLP]


  45. Reverse Engineering an Agent-Based Hidden Markov Model for Complex Social Systems. [Citation Graph (, )][DBLP]


  46. Approximating the Covariance Matrix of GMMs with Low-Rank Perturbations. [Citation Graph (, )][DBLP]


  47. Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD. [Citation Graph (, )][DBLP]


  48. A Generative Model for Statistical Determination of Information Content from Conversation Threads. [Citation Graph (, )][DBLP]


  49. A locality model of the evolution of blog networks. [Citation Graph (, )][DBLP]


  50. Communication Dynamics of Blog Networks. [Citation Graph (, )][DBLP]


  51. Adapting to a Market Shock: Optimal Sequential Market-Making. [Citation Graph (, )][DBLP]


  52. Accelerating the MilkyWay@Home Volunteer Computing Project with GPUs. [Citation Graph (, )][DBLP]


  53. A Permutation Approach to Validation. [Citation Graph (, )][DBLP]


  54. Collective wisdom: information growth in wikis and blogs. [Citation Graph (, )][DBLP]


  55. Pricing the American Option Using Reconfigurable Hardware. [Citation Graph (, )][DBLP]


  56. Stable Statistics of the Blogograph. [Citation Graph (, )][DBLP]


  57. Models of Communication Dynamics for Simulation of Information Diffusion. [Citation Graph (, )][DBLP]


  58. Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix [Citation Graph (, )][DBLP]


  59. Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound [Citation Graph (, )][DBLP]


  60. Contention-free MAC protocols for asynchronous wireless sensor networks. [Citation Graph (, )][DBLP]


Search in 0.150secs, Finished in 0.152secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002