| 2009 |
27 | | Anthony Sherbondy,
Robert Dougherty,
Rajagopal Ananthanarayanan,
Dharmendra S. Modha,
Brian A. Wandell:
Think Global, Act Local; Projectome Estimation with BlueMatter.
MICCAI (1) 2009: 861-868 |
26 | | Rajagopal Ananthanarayanan,
Steven K. Esser,
Horst D. Simon,
Dharmendra S. Modha:
The cat is out of the bag: cortical simulations with 109 neurons, 1013 synapses.
SC 2009 |
| 2007 |
25 | | Rajagopal Ananthanarayanan,
Dharmendra S. Modha:
Anatomy of a cortical simulator.
SC 2007: 3 |
| 2006 |
24 | | Dharmendra S. Modha,
Narayana P. Santhanam:
Making the Correct Mistakes.
DCC 2006: 302-311 |
23 | | Justin Brickell,
Inderjit S. Dhillon,
Dharmendra S. Modha:
Adaptive Website Design Using Caching Algorithms.
WEBKDD 2006: 1-20 |
| 2005 |
22 | | Binny S. Gill,
Dharmendra S. Modha:
WOW: Wise Ordering for Writes - Combining Spatial and Temporal Locality in Non-Volatile Caches.
FAST 2005 |
21 | | Binny S. Gill,
Dharmendra S. Modha:
SARC: Sequential Prefetching in Adaptive Replacement Cache.
USENIX Annual Technical Conference, General Track 2005: 293-308 |
| 2004 |
20 | | Sorav Bansal,
Dharmendra S. Modha:
CAR: Clock with Adaptive Replacement.
FAST 2004: 187-200 |
19 | | Arindam Banerjee,
Inderjit S. Dhillon,
Joydeep Ghosh,
Srujana Merugu,
Dharmendra S. Modha:
A generalized maximum entropy approach to bregman co-clustering and matrix approximation.
KDD 2004: 509-514 |
18 | | Deepayan Chakrabarti,
Spiros Papadimitriou,
Dharmendra S. Modha,
Christos Faloutsos:
Fully automatic cross-associations.
KDD 2004: 79-88 |
17 | | Nimrod Megiddo,
Dharmendra S. Modha:
Outperforming LRU with an Adaptive Replacement Cache Algorithm.
IEEE Computer 37(4): 58-65 (2004) |
| 2003 |
16 | | Dharmendra S. Modha:
Codelet Parsing: Quadratic-time, Sequential, Adaptive Algorithms for Lossy Compression.
DCC 2003: 223-232 |
15 | | Nimrod Megiddo,
Dharmendra S. Modha:
ARC: A Self-Tuning, Low Overhead Replacement Cache.
FAST 2003 |
14 | | Pawan Goyal,
Divyesh Jadav,
Dharmendra S. Modha,
Renu Tewari:
CacheCOW: QoS for Storage System Caches.
IWQoS 2003: 498-515 |
13 | | Inderjit S. Dhillon,
Subramanyam Mallela,
Dharmendra S. Modha:
Information-theoretic co-clustering.
KDD 2003: 89-98 |
12 | | Pawan Goyal,
Dharmendra S. Modha,
Renu Tewari:
CacheCOW: providing QoS for storage system caches.
SIGMETRICS 2003: 306-307 |
11 | | Dharmendra S. Modha,
W. Scott Spangler:
Feature Weighting in k-Means Clustering.
Machine Learning 52(3): 217-237 (2003) |
| 2002 |
10 | | Inderjit S. Dhillon,
Dharmendra S. Modha,
W. Scott Spangler:
Class visualization of high-dimensional data with applications.
Computational Statistics & Data Analysis 41(1): 59-90 (2002) |
9 | | Larry J. Stockmeyer,
Dharmendra S. Modha:
Links between complexity theory and constrained block coding.
IEEE Transactions on Information Theory 48(1): 59-88 (2002) |
| 2001 |
8 | | Larry J. Stockmeyer,
Dharmendra S. Modha:
Links Between Complexity Theory and Constrained Block Coding.
IEEE Conference on Computational Complexity 2001: 226-243 |
7 | | Inderjit S. Dhillon,
Dharmendra S. Modha:
Concept Decompositions for Large Sparse Text Data Using Clustering.
Machine Learning 42(1/2): 143-175 (2001) |
| 2000 |
6 | | Dharmendra S. Modha,
W. Scott Spangler:
Clustering hypertext with applications to web searching.
Hypertext 2000: 143-152 |
5 | | Isaac L. Chuang,
Dharmendra S. Modha:
Reversible arithmetic coding for quantum data compression.
IEEE Transactions on Information Theory 46(3): 1104-1116 (2000) |
| 1999 |
4 | | Inderjit S. Dhillon,
Dharmendra S. Modha:
A Data-Clustering Algorithm on Distributed Memory Multiprocessors.
Large-Scale Parallel Data Mining 1999: 245-260 |
| 1998 |
3 | | Dharmendra S. Modha,
Elias Masry:
Memory-Universal Prediction of Stationary Random Processes.
IEEE Transactions on Information Theory 44(1): 117-133 (1998) |
2 | | Dharmendra S. Modha,
Elias Masry:
Prequential and Cross-Validated Regression Estimation.
Machine Learning 33(1): 5-39 (1998) |
| 1996 |
1 | | Dharmendra S. Modha,
Elias Masry:
Minimum complexity regression estimation with weakly dependent observations.
IEEE Transactions on Information Theory 42(6): 2133-2145 (1996) |