![]() | ![]() |
| 2012 | ||
|---|---|---|
| 49 | Animashree Anandkumar, Daniel Hsu, Sham M. Kakade: A Method of Moments for Mixture Models and Hidden Markov Models CoRR abs/1203.0683: (2012) | |
| 48 | Animashree Anandkumar, Daniel Hsu, Sham M. Kakade: Learning High-Dimensional Mixtures of Graphical Models CoRR abs/1203.0697: (2012) | |
| 47 | Animashree Anandkumar, Dean P. Foster, Daniel Hsu, Sham M. Kakade, Yi-Kai Liu: Two SVDs Suffice: Spectral decompositions for probabilistic topic modeling and latent Dirichlet allocation CoRR abs/1204.6703: (2012) | |
| 2011 | ||
| 46 | Ting He, Animashree Anandkumar, Dakshi Agrawal: Index-based sampling policies for tracking dynamic networks under sampling constraints. INFOCOM 2011: 1233-1241 | |
| 45 | Paul Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky: Energy-latency tradeoff for in-network function computation in random networks. INFOCOM 2011: 1575-1583 | |
| 44 | M. Amin Khajehnejad, Juhwan Yoo, Animashree Anandkumar, Babak Hassibi: Summary based structures with improved sublinear recovery for compressed sensing. ISIT 2011: 1427-1431 | |
| 43 | Animashree Anandkumar, Vincent Y. F. Tan, Alan S. Willsky: High-Dimensional Graphical Model Selection: Tractable Graph Families and Necessary Conditions. NIPS 2011: 1863-1871 | |
| 42 | Animashree Anandkumar, Kamalika Chaudhuri, Daniel Hsu, Sham M. Kakade, Le Song, Tong Zhang: Spectral Methods for Learning Multivariate Latent Tree Structure. NIPS 2011: 2025-2033 | |
| 41 | Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner: Topology discovery of sparse random graphs with few participants. SIGMETRICS 2011: 293-304 | |
| 40 | Paul N. Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky: Energy-Latency Tradeoff for In-Network Function Computation in Random Networks CoRR abs/1101.0858: (2011) | |
| 39 | Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner: Topology Discovery of Sparse Random Graphs With Few Participants CoRR abs/1102.5063: (2011) | |
| 38 | M. Amin Khajehnejad, Juhwan Yoo, Animashree Anandkumar, Babak Hassibi: Summary Based Structures with Improved Sublinear Recovery for Compressed Sensing CoRR abs/1102.5462: (2011) | |
| 37 | Ying Liu, Venkat Chandrasekaran, Animashree Anandkumar, Alan S. Willsky: Feedback Message Passing for Inference in Gaussian Graphical Models CoRR abs/1105.1853: (2011) | |
| 36 | Animashree Anandkumar, Vincent Y. F. Tan, Alan S. Willsky: High-Dimensional Gaussian Graphical Model Selection: Tractable Graph Families CoRR abs/1107.1270: (2011) | |
| 35 | Animashree Anandkumar, Kamalika Chaudhuri, Daniel Hsu, Sham M. Kakade, Le Song, Tong Zhang: Spectral Methods for Learning Multivariate Latent Tree Structure CoRR abs/1107.1283: (2011) | |
| 34 | Animashree Anandkumar, Vincent Y. F. Tan, Alan S. Willsky: High-Dimensional Structure Estimation in Ising Models: Tractable Graph Families CoRR abs/1107.1736: (2011) | |
| 33 | Animashree Anandkumar, Nithin Michael, Ao Kevin Tang, Ananthram Swami: Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret. IEEE Journal on Selected Areas in Communications 29(4): 731-745 (2011) | |
| 32 | Vincent Y. F. Tan, Animashree Anandkumar, Lang Tong, Alan S. Willsky: A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures. IEEE Transactions on Information Theory 57(3): 1714-1735 (2011) | |
| 31 | Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky: Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates. Journal of Machine Learning Research 12: 1617-1653 (2011) | |
| 30 | Myung Jin Choi, Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky: Learning Latent Tree Graphical Models. Journal of Machine Learning Research 12: 1771-1812 (2011) | |
| 2010 | ||
| 29 | Amod J. G. Anandkumar, Animashree Anandkumar, Sangarapillai Lambotharan, Jonathon A. Chambers: Robust rate-maximization game under bounded channel uncertainty. ICASSP 2010: 3158-3161 | |
| 28 | Animashree Anandkumar, Nithin Michael, Ao Tang: Opportunistic Spectrum Access with Multiple Users: Learning under Competition. INFOCOM 2010: 803-811 | |
| 27 | Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky: Error exponents for composite hypothesis testing of Markov forest distributions. ISIT 2010: 1613-1617 | |
| 26 | Ying Liu, Venkat Chandrasekaran, Animashree Anandkumar, Alan S. Willsky: Feedback message passing for inference in gaussian graphical models. ISIT 2010: 1683-1687 | |
| 25 | Animashree Anandkumar, Joseph E. Yukich, Alan S. Willsky: Limit laws for random spatial graphical models. ISIT 2010: 1728-1732 | |
| 24 | Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky: Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates CoRR abs/1005.0766: (2010) | |
| 23 | Animashree Anandkumar, Nithin Michael, Ao Kevin Tang, Ananthram Swami: Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret CoRR abs/1006.1673: (2010) | |
| 22 | Animashree Anandkumar, Ting He, Chatschik Bisdikian, Dakshi Agrawal: Seeing Through Black Boxes : Tracking Transactions through Queues under Monitoring Resource Constraints CoRR abs/1006.1674: (2010) | |
| 21 | Myung Jin Choi, Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky: Learning Latent Tree Graphical Models CoRR abs/1009.2722: (2010) | |
| 20 | Amod J. G. Anandkumar, Animashree Anandkumar, Sangarapillai Lambotharan, Jonathon A. Chambers: Robust Rate-Maximization Game Under Bounded Channel Uncertainty CoRR abs/1011.1566: (2010) | |
| 19 | Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky: Learning Gaussian tree models: analysis of error exponents and extremal structures. IEEE Transactions on Signal Processing 58(5): 2701-2714 (2010) | |
| 2009 | ||
| 18 | Animashree Anandkumar, Meng Wang, Lang Tong, Ananthram Swami: Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference. INFOCOM 2009: 2150-2158 | |
| 17 | Vincent Y. F. Tan, Animashree Anandkumar, Lang Tong, Alan S. Willsky: A large-deviation analysis for the maximum likelihood learning of tree structures. ISIT 2009: 1140-1144 | |
| 16 | Animashree Anandkumar, Alan S. Willsky, Lang Tong: Detection error exponent for spatially dependent samples in random networks. ISIT 2009: 2882-2886 | |
| 15 | Vincent Y. F. Tan, Animashree Anandkumar, Lang Tong, Alan S. Willsky: A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures CoRR abs/0905.0940: (2009) | |
| 14 | Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky: Learning Gaussian Tree Models: Analysis of Error Exponents and Extremal Structures CoRR abs/0909.5216: (2009) | |
| 13 | Animashree Anandkumar, Ananthram Swami, Joseph E. Yukich, Lang Tong: Energy Scaling Laws for Distributed Inference in Random Fusion Networks. IEEE Journal on Selected Areas in Communications 27(7): 1203-1217 (2009) | |
| 12 | Animashree Anandkumar, Lang Tong, Ananthram Swami: Detection of Gauss-Markov Random Fields With Nearest-Neighbor Dependency. IEEE Transactions on Information Theory 55(2): 816-827 (2009) | |
| 11 | Animashree Anandkumar, Chatschik Bisdikian, Ting He, Dakshi Agrawal: Selectively retrofitting monitoring in distributed systems. SIGMETRICS Performance Evaluation Review 37(2): 6-8 (2009) | |
| 2008 | ||
| 10 | Animashree Anandkumar, Lang Tong, Ananthram Swami, Anthony Ephremides: Minimum Cost Data Aggregation with Localized Processing for Statistical Inference. INFOCOM 2008: 780-788 | |
| 9 | Animashree Anandkumar, Lang Tong, Ananthram Swami, Anthony Ephremides: Cost-performance tradeoff in multi-hop aggregation for statistical inference. ISIT 2008: 662-666 | |
| 8 | Bikram Sengupta, Nilanjan Banerjee, Animashree Anandkumar, Chatschik Bisdikian: Non-intrusive transaction monitoring using system logs. NOMS 2008: 879-882 | |
| 7 | Animashree Anandkumar, Chatschik Bisdikian, Dakshi Agrawal: Tracking in a spaghetti bowl: monitoring transactions using footprints. SIGMETRICS 2008: 133-144 | |
| 6 | Animashree Anandkumar, Joseph E. Yukich, Lang Tong, Ananthram Swami: Energy Scaling Laws for Distributed Inference in Random Networks CoRR abs/0809.0686: (2008) | |
| 5 | Animashree Anandkumar, Lang Tong, Ananthram Swami: Distributed Estimation Via Random Access. IEEE Transactions on Information Theory 54(7): 3175-3181 (2008) | |
| 4 | Animashree Anandkumar, Lang Tong, Ananthram Swami: Optimal Node Density for Detection in Energy-Constrained Random Networks. IEEE Transactions on Signal Processing 56(10-2): 5232-5245 (2008) | |
| 2007 | ||
| 3 | Animashree Anandkumar, Lang Tong, Ananthram Swami: Energy Efficient Routing for Statistical Inference of Markov Random Fields. CISS 2007: 643-648 | |
| 2 | Animashree Anandkumar, Lang Tong, Ananthram Swami: Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency CoRR abs/0706.1588: (2007) | |
| 1 | Animashree Anandkumar, Lang Tong: Type-Based Random Access for Distributed Detection Over Multiaccess Fading Channels. IEEE Transactions on Signal Processing 55(10): 5032-5043 (2007) | |
Colors in the list of coauthors
Last update Sat May 26 04:23:17 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page