Sciweavers

1940 search results - page 83 / 388
» Graph Transformation with Variables
Sort
View
GD
2005
Springer
15 years 8 months ago
Visualizing Graphs as Trees: Plant a Seed and Watch it Grow
TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific no...
Bongshin Lee, Cynthia Sims Parr, Catherine Plaisan...
VL
1999
IEEE
104views Visual Languages» more  VL 1999»
15 years 7 months ago
Pragmatic Graph Rewriting Modifications
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host...
Peter J. Rodgers, Natalia Vidal
IJAR
2006
125views more  IJAR 2006»
15 years 3 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
TIM
2010
148views Education» more  TIM 2010»
14 years 10 months ago
Measurement of Heart Rate Variability Using an Oscillometric Blood Pressure Monitor
Abstract--We apply the maximal overlap discrete wavelet transform (MODWT)-based spectral density estimation method to measure heart rate variability (HRV) from short-duration pulse...
S. Ahmad, Miodrag Bolic, Hilmi R. Dajani, Voicu Gr...
ESCAPE
2007
Springer
256views Algorithms» more  ESCAPE 2007»
15 years 7 months ago
A More Effective Linear Kernelization for Cluster Editing
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
Jiong Guo