The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sreenivas Gollapudi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sreenivas Gollapudi, D. Sivakumar
    Framework and algorithms for trend analysis in massive temporal data sets. [Citation Graph (0, 0)][DBLP]
    CIKM, 2004, pp:168-177 [Conf]
  2. Sreenivas Gollapudi, Rina Panigrahy
    Exploiting asymmetry in hierarchical topic extraction. [Citation Graph (0, 0)][DBLP]
    CIKM, 2006, pp:475-482 [Conf]
  3. Sreenivas Gollapudi, Rina Panigrahy
    A dictionary for approximate string search and longest prefix search. [Citation Graph (0, 0)][DBLP]
    CIKM, 2006, pp:768-775 [Conf]
  4. Sreenivas Gollapudi, Aidong Zhang
    Buffer Management in Multimedia Database Systems. [Citation Graph (0, 0)][DBLP]
    ICMCS, 1996, pp:186-0 [Conf]
  5. Sreenivas Gollapudi, D. Sivakumar, Aidong Zhang
    Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:2147-2158 [Conf]
  6. Sreenivas Gollapudi, Aidong Zhang
    NetMedia: A Client-Server Distributed Multimedia Environment. [Citation Graph (0, 0)][DBLP]
    IW-MMDBMS, 1996, pp:160-167 [Conf]
  7. Sreenivas Gollapudi, D. Sivakumar
    A mechanism for equitable bandwidth allocation under QoS and budget constraints. [Citation Graph (0, 0)][DBLP]
    IWQoS, 2004, pp:138-147 [Conf]
  8. Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
    Programmable clustering. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:348-354 [Conf]
  9. Sreenivas Gollapudi, Aidong Zhang
    Buffer Model and Management in Distributed Multimedia Presentation Systems. [Citation Graph (0, 0)][DBLP]
    Multimedia Syst., 1998, v:6, n:3, pp:206-218 [Journal]
  10. Aidong Zhang, Sreenivas Gollapudi
    QoS Management in Educational Digital Library Environments. [Citation Graph (0, 0)][DBLP]
    Multimedia Tools Appl., 2000, v:10, n:2/3, pp:133-156 [Journal]
  11. Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
    Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms. [Citation Graph (0, 0)][DBLP]
    WAW, 2007, pp:195-201 [Conf]

  12. Sparse Cut Projections in Graph Streams. [Citation Graph (, )][DBLP]


  13. Learning optimally diverse rankings over large document collections. [Citation Graph (, )][DBLP]


  14. Bypass rates: reducing query abandonment using negative inferences. [Citation Graph (, )][DBLP]


  15. The power of two min-hashes for similarity search among hierarchical data objects. [Citation Graph (, )][DBLP]


  16. Estimating PageRank on graph streams. [Citation Graph (, )][DBLP]


  17. Budget constrained auctions with heterogeneous items. [Citation Graph (, )][DBLP]


  18. Public Advertisement Broker Markets. [Citation Graph (, )][DBLP]


  19. An axiomatic approach for result diversification. [Citation Graph (, )][DBLP]


  20. A sketch-based distance oracle for web-scale graphs. [Citation Graph (, )][DBLP]


  21. Ranking mechanisms in twitter-like forums. [Citation Graph (, )][DBLP]


  22. Less is more: sampling the neighborhood graph makes SALSA better and faster. [Citation Graph (, )][DBLP]


  23. Diversifying search results. [Citation Graph (, )][DBLP]


  24. Budget Constrained Auctions with Heterogeneous Items [Citation Graph (, )][DBLP]


  25. Revisiting the Examination Hypothesis with Query Specific Position Bias [Citation Graph (, )][DBLP]


  26. Learning optimally diverse rankings over large document collections [Citation Graph (, )][DBLP]


  27. An Axiomatic Framework for Result Diversification. [Citation Graph (, )][DBLP]


Search in 0.023secs, Finished in 0.024secs
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