Vinilkant Tejaswi

Learn More
The architecture of a simple and network-able data-driven processor is demonstrated. The processor uses computational data-flow graphs as its programming model, in which functional processing nodes exhibit data dependencies among each other to execute instructions. The nature of the program execution method differs from a conventional processor, which uses(More)
Influence maximization deals with finding a small set of nodes, called seed set, to be initially influenced such that they will eventually spread the influence to maximum number of users in the social network. This paper deals with a specialization of the basic problem called labeled influence maximization that identifies seeds that will maximize the(More)
  • 1