Sciweavers

1439 search results - page 267 / 288
» Fast approximation of centrality
Sort
View
SIROCCO
2010
13 years 11 months ago
Traffic Grooming in Star Networks via Matching Techniques
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
NIPS
2004
13 years 11 months ago
Probabilistic Inference of Alternative Splicing Events in Microarray Data
Alternative splicing (AS) is an important and frequent step in mammalian gene expression that allows a single gene to specify multiple products, and is crucial for the regulation ...
Ofer Shai, Brendan J. Frey, Quaid Morris, Qun Pan,...
SIGMETRICS
2010
ACM
193views Hardware» more  SIGMETRICS 2010»
13 years 10 months ago
Distributed caching over heterogeneous mobile networks
Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a lo...
Stratis Ioannidis, Laurent Massoulié, Augus...
BMCBI
2007
127views more  BMCBI 2007»
13 years 10 months ago
Characterization of protein-interaction networks in tumors
Background: Analyzing differential-gene-expression data in the context of protein-interaction networks (PINs) yields information on the functional cellular status. PINs can be for...
Alexander Platzer, Paul Perco, Arno Lukas, Bernd M...
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...