|
Search the dblp DataBase
Deepayan Chakrabarti:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Deepayan Chakrabarti, Christos Faloutsos
F4: large-scale automated forecasting using fractals. [Citation Graph (0, 0)][DBLP] CIKM, 2002, pp:2-9 [Conf]
- Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Christos Faloutsos
Neighborhood Formation and Anomaly Detection in Bipartite Graphs. [Citation Graph (0, 0)][DBLP] ICDM, 2005, pp:418-425 [Conf]
- Yufeng Liu, Rosemary Emery, Deepayan Chakrabarti, Wolfram Burgard, Sebastian Thrun
Using EM to Learn 3D Models of Indoor Environments with Mobile Robots. [Citation Graph (0, 0)][DBLP] ICML, 2001, pp:329-336 [Conf]
- Deepayan Chakrabarti, Ravi Kumar, Andrew Tomkins
Evolutionary clustering. [Citation Graph (0, 0)][DBLP] KDD, 2006, pp:554-560 [Conf]
- Deepayan Chakrabarti, Spiros Papadimitriou, Dharmendra S. Modha, Christos Faloutsos
Fully automatic cross-associations. [Citation Graph (0, 0)][DBLP] KDD, 2004, pp:79-88 [Conf]
- Deepayan Chakrabarti
AutoPart: Parameter-Free Graph Partitioning and Outlier Detection. [Citation Graph (0, 0)][DBLP] PKDD, 2004, pp:112-124 [Conf]
- Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinberg, Christos Faloutsos
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication. [Citation Graph (0, 0)][DBLP] PKDD, 2005, pp:133-145 [Conf]
- Deepayan Chakrabarti, Yiping Zhan, Christos Faloutsos
R-MAT: A Recursive Model for Graph Mining. [Citation Graph (0, 0)][DBLP] SDM, 2004, pp:- [Conf]
- Yang Wang, Deepayan Chakrabarti, Chenxi Wang, Christos Faloutsos
Epidemic Spreading in Real Networks: An Eigenvalue Viewpoint. [Citation Graph (0, 0)][DBLP] SRDS, 2003, pp:25-34 [Conf]
- Deepayan Chakrabarti, Christos Faloutsos
Graph mining: Laws, generators, and algorithms. [Citation Graph (0, 0)][DBLP] ACM Comput. Surv., 2006, v:38, n:1, pp:- [Journal]
- Deepayan Chakrabarti, Christos Faloutsos, Yiping Zhan
Visualization of large networks with min-cut plots, A-plots and R-MAT. [Citation Graph (0, 0)][DBLP] Int. J. Hum.-Comput. Stud., 2007, v:65, n:5, pp:434-445 [Journal]
- Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Christos Faloutsos
Relevance search and anomaly detection in bipartite graphs. [Citation Graph (0, 0)][DBLP] SIGKDD Explorations, 2005, v:7, n:2, pp:48-55 [Journal]
- Sandeep Pandey, Deepayan Chakrabarti, Deepak Agarwal
Multi-armed bandit problems with dependent arms. [Citation Graph (0, 0)][DBLP] ICML, 2007, pp:721-728 [Conf]
- Deepayan Chakrabarti, Jure Leskovec, Christos Faloutsos, Samuel Madden, Carlos Guestrin, Michalis Faloutsos
Information Survival Threshold in Sensor and P2P Networks. [Citation Graph (0, 0)][DBLP] INFOCOM, 2007, pp:1316-1324 [Conf]
- Deepak Agarwal, Andrei Z. Broder, Deepayan Chakrabarti, Dejan Diklic, Vanja Josifovski, Mayssam Sayyadian
Estimating rates of rare events at multiple resolutions. [Citation Graph (0, 0)][DBLP] KDD, 2007, pp:16-25 [Conf]
- Sandeep Pandey, Deepak Agarwal, Deepayan Chakrabarti, Vanja Josifovski
Bandits for Taxonomies: A Model-based Approach. [Citation Graph (0, 0)][DBLP] SDM, 2007, pp:- [Conf]
- Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
Page-level template detection via isotonic smoothing. [Citation Graph (0, 0)][DBLP] WWW, 2007, pp:61-70 [Conf]
Generating succinct titles for web URLs. [Citation Graph (, )][DBLP]
Mining broad latent query aspects from search sessions. [Citation Graph (, )][DBLP]
Mortal Multi-Armed Bandits. [Citation Graph (, )][DBLP]
ShatterPlots: Fast Tools for Mining Large Graphs. [Citation Graph (, )][DBLP]
Contextual advertising by combining relevance with click feedback. [Citation Graph (, )][DBLP]
A graph-theoretic approach to webpage segmentation. [Citation Graph (, )][DBLP]
Quicklink selection for navigational query results. [Citation Graph (, )][DBLP]
The paths more taken: matching DOM trees to search logs for accurate webpage clustering. [Citation Graph (, )][DBLP]
A Real-time Algorithm for Acquiring Multi-Planar Volumetric Models with Mobile Robots. [Citation Graph (, )][DBLP]
Search in 0.132secs, Finished in 0.134secs
|