Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Srinivas Kashyap"'
Publikováno v:
Proceedings of the National Academy of Sciences of the United States of America. 114(21)
Methods for studying functional genomics of ion-channel target sites of antinematodal drugs (anthelmintics) have been limited to the model nematode Caenorhabditis elegans because many techniques for studying animal parasitic nematodes have been unsuc
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 23:2315-2329
The increasing popularity of large-scale distributed applications in datacenters has led to the growing demand of distributed application state monitoring. These application state monitoring tasks often involve collecting values of various status att
Autor:
Samir Khuller, Srinivas Kashyap
Publikováno v:
Journal of Algorithms. 60:144-167
We study an optimization problem that arises in the context of data placement in a multimedia storage system. We are given a collection of M multimedia objects (data items) that need to be assigned to a storage system consisting of N disks d1, d2,...
Publikováno v:
ICDCS
To observe, analyze and control large scale distributed systems and the applications hosted on them, there is an increasing need to continuously monitor performance attributes of distributed system and application states. This results in application
Publikováno v:
ICDE
Detecting constraint violations in large-scale distributed systems has recently attracted plenty of attention from the research community due to its varied applications (security, network monitoring, etc.). Communication efficiency of these systems i
Publikováno v:
PODS
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a novel gossip-based scheme using which all the nodes in an n-node overla
Publikováno v:
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX).
Publikováno v:
ICDCS
We consider the problem of handling similarity queries in peer-to-peer databases. We propose an indexing and searching mechanism which, given a query object, returns the set of objects in the database that are semantically related to the query. We pr
Publikováno v:
CIKM
Our work is motivated by the problem of ranking hyper-linked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based model and an efficient method to dynamically rank the nodes of this gra
Autor:
Srinivas Kashyap, Samir Khuller
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540206804
FSTTCS
FSTTCS
We study an optimization problem that arises in the context of data placement in a multimedia storage system. We are given a collection of M multimedia objects (data items) that need to be assigned to a storage system consisting of N disks d 1,d 2...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07a191d40e6f27a7e0236374b6396df7
https://doi.org/10.1007/978-3-540-24597-1_23
https://doi.org/10.1007/978-3-540-24597-1_23