Sciweavers

736 search results - page 18 / 148
» Approximating the Number of Network Motifs
Sort
View
NAR
2011
176views Computer Vision» more  NAR 2011»
12 years 11 months ago
IUPHAR-DB: new receptors and tools for easy searching and visualization of pharmacological data
The IUPHAR database is an established online reference resource for several important classes of human drug targets and related proteins. As well as providing recommended nomencla...
Joanna L. Sharman, Chidochangu P. Mpamhanga, Micha...
SPAA
2010
ACM
14 years 1 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
WABI
2010
Springer
124views Bioinformatics» more  WABI 2010»
13 years 6 months ago
Improved Orientations of Physical Networks
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
Iftah Gamzu, Danny Segev, Roded Sharan
ALGOSENSORS
2008
Springer
13 years 10 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
ICDCS
2010
IEEE
14 years 13 days ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...