Sciweavers

1756 search results - page 314 / 352
» Directed scale-free graphs
Sort
View
96
Voted
ESA
1993
Springer
109views Algorithms» more  ESA 1993»
15 years 4 months ago
Optimal Upward Planarity Testing of Single-Source Digraphs
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
Paola Bertolazzi, Giuseppe Di Battista, Carlo Mann...
107
Voted
PLDI
1990
ACM
15 years 4 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
115
Voted
MM
2010
ACM
204views Multimedia» more  MM 2010»
15 years 21 days ago
Crew: cross-modal resource searching by exploiting wikipedia
In Web 2.0, users have generated and shared massive amounts of resources in various media formats, such as news, blogs, audios, photos and videos. The abundance and diversity of t...
Chen Liu, Beng Chin Ooi, Anthony K. H. Tung, Dongx...
FPGA
2010
ACM
232views FPGA» more  FPGA 2010»
15 years 20 days ago
High-throughput bayesian computing machine with reconfigurable hardware
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
Mingjie Lin, Ilia Lebedev, John Wawrzynek
BMCBI
2010
178views more  BMCBI 2010»
15 years 18 days ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...