Sciweavers

2057 search results - page 303 / 412
» Scalable and Structured Scheduling
Sort
View
BMCBI
2007
144views more  BMCBI 2007»
15 years 3 months ago
Accelerated search for biomolecular network models to interpret high-throughput experimental data
Background: The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein e...
Suman Datta, Bahrad A. Sokhansanj
TVCG
2008
119views more  TVCG 2008»
15 years 3 months ago
Exploration of Networks using overview+detail with Constraint-based cooperative layout
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
Tim Dwyer, Kim Marriott, Falk Schreiber, Peter J. ...
148
Voted
CCR
2002
97views more  CCR 2002»
15 years 3 months ago
Multi-modal network protocols
Most network protocols are uni-modal: they employ a single set of algorithms that allows them to cope well only within a narrow range of operating conditions. This rigid design re...
Rajesh Krishna Balan, Aditya Akella, Srinivasan Se...
140
Voted
TCAD
2002
135views more  TCAD 2002»
15 years 3 months ago
Area fill synthesis for uniform layout density
Chemical-mechanical polishing (CMP) and other manufacturing steps in very deep submicron VLSI have varying effects on device and interconnect features, depending on local character...
Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexande...
106
Voted
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 1 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna