Anand Srinivasan
Business International Corporation
6 Papers
57 Citations
Anand Srinivasan is an academic researcher from Business International Corporation. The author has contributed to research in topics: The Internet & Natural language. The author has an hindex of 4, co-authored 6 publications. Previous affiliations of Anand Srinivasan include University of Minnesota & Oracle Corporation.
Chat about Author
Papers
Towards a streaming SQL standard
Namit Jain,Shailendra Mishra,Anand Srinivasan,Johannes Gehrke,Jennifer Widom,Hari Balakrishnan,Uǧur Çetintemel,Mitch Cherniack,Richard Tibbetts,Stan Zdonik +9 more
- 01 Aug 2008
TL;DR: The semantics of SPREAD is described, a unification of two different SQL extensions for streams and its associated semantics that gives the user control over the granularity at which one can express simultaneity.
Edge domination on bipartite permutation graphs and cotriangulated graphs
TL;DR: This work develops polynomial time algorithms for finding a minimum edge dominating set for a cotriangulated graph and a bipartite permutation graph.
43
Patent
Internet cloud-hosted natural language interactive messaging system with virtual database
Shailendra Mishra,Anand Srinivasan,Sangameswaran Viswanathan +2 more
- 27 Jul 2017
TL;DR: In this paper, the authors present methods, systems, and computer-program products for responding to a natural language communication, sending a response to request additional information from a user, and exposing an invocable method for accessing a virtual database.
6
Patent
Internet cloud-hosted natural language interactive messaging system with entity-based communication
Sangameswaran Viswanathan,Shailendra Mishra,Anand Srinivasan +2 more
- 27 Jul 2017
TL;DR: In this article, the authors present methods, systems, and computer-program products for responding to a natural language communication, sending a response to request additional information from a user, and exposing an invocable method for accessing a virtual database.
4
Partial and perfect path covers of cographs
TL;DR: It is shown that every cograph has a perfect path cover, and this is exploited to obtain an O(m + n log n)-time algorithm for finding, for any arbitrary k, a k -blanket or a k-core of a arbitrary cograph on n vertices and m edges.
3