5592 search results - page 1055 / 1119 » On Random Betweenness Constraints |
KDD
2012
ACM
12 years 13 days ago
2012
ACM
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...
KDD
2012
ACM
12 years 13 days ago
2012
ACM
Online controlled experiments are often utilized to make datadriven decisions at Amazon, Microsoft, eBay, Facebook, Google, Yahoo, Zynga, and at many other companies. While the th...
BMCBI
2007
13 years 10 months ago
2007
Background: The translational efficiency of an mRNA can be modulated by upstream open reading frames (uORFs) present in certain genes. A uORF can attenuate translation of the main...
TAP
2008
Springer
13 years 10 months ago
2008
Springer
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
ECCC
2007
13 years 9 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...