Results 41 to 50 of about 2,805,373 (250)
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Tractable diffusion and coalescent processes for weakly correlated loci [PDF]
, 2015 Widely used models in genetics include the Wright-Fisher diffusion and its moment dual, Kingman's coalescent. Each has a multilocus extension but under neither extension is the sampling distribution available in closed-form, and their computation is ...
Fearnhead, Paul +6 more
core +1 more source
CoRRMetric graphs are structures obtained by associating edges in a standard graph with segments of the real line and gluing these segments at the vertices of the graph. The resulting structure has a natural metric that allows for the study of differential operators and stochastic processes on the graph.
Rajat Vadiraj Dwaraknath, Lexing Ying
openaire +3 more sources
Halton Sampling for Image Registration Based on Mutual Information
, 2008 Mutual information is a widely used similarity measure for aligning multimodal medical images. At its core, it relies on the computation of a discrete joint histogram, which itself requires image samples for its estimation.
Michel Bierlaire +5 more
core +1 more source
Selective sampling on graphs for classification [PDF]
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, 2013 Selective sampling is an active variant of online learning in which the learner is allowed to adaptively query the label of an observed example. The goal of selective sampling is to achieve a good trade-off between prediction performance and the number of queried labels. Existing selective sampling algorithms are designed for vector-based data. In this
Quanquan Gu +3 more
openaire +1 more source
Graph-based implicit knowledge discovery from architecture change logs [PDF]
, 2012 Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344) +12 more
core +2 more sources
A Survey and Taxonomy of Graph Sampling
CoRR, 2013 Graph sampling is a technique to pick a subset of vertices and/ or edges from original graph. It has a wide spectrum of applications, e.g. survey hidden population in sociology [54], visualize social graph [29], scale down Internet AS graph [27], graph sparsification [8], etc.
Pili Hu, Wing Cheong Lau
openaire +2 more sources
, 2013 In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT We assessed the effect of iron overload (IO) on mortality and complications following hematopoietic stem cell transplantation (HSCT) in patients with Diamond–Blackfan anemia syndrome (DBAS) in a systematic review of individual participant data and cohort data from observational studies.
Geoffrey Z. L. Kuppens +6 more
wiley +1 more source
A second look at counting triangles in graph streams [PDF]
, 2014 In this paper we present improved results on the problem of counting triangles in edge streamed graphs. For graphs with m edges and at least T triangles, we show that an extra look over the stream yields a two-pass streaming algorithm that uses O((m)/(ε4.
Jowhari, Hossein, Cormode, Graham
core +1 more source