Sciweavers

1161 search results - page 19 / 233
» Kinetic Dependence Graphs
Sort
View
CORR
2012
Springer
230views Education» more  CORR 2012»
12 years 5 months ago
Fast Triangle Counting through Wedge Sampling
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
C. Seshadhri, Ali Pinar, Tamara G. Kolda
ISCAPDCS
2007
13 years 11 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel
FUIN
2000
68views more  FUIN 2000»
13 years 9 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
VISSOFT
2005
IEEE
14 years 3 months ago
DependencyViewer - A Tool for Visualizing Package Design Quality Metrics
DependencyViewer helps to control package dependencies to avoid degeneration of package designs. To this end it computes design quality metrics including stabilabstractness for ea...
Michael Wilhelm, Stephan Diehl
EMNLP
2009
13 years 7 months ago
Statistical Bistratal Dependency Parsing
We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubictime search al...
Richard Johansson