Sciweavers

1503 search results - page 93 / 301
» Detecting Anomalies in Graphs
Sort
View
APVIS
2009
15 years 5 months ago
TugGraph: Path-preserving hierarchies for browsing proximity and paths in graphs
Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place the...
Daniel Archambault, Tamara Munzner, David Auber
152
Voted
JCT
2008
109views more  JCT 2008»
15 years 4 months ago
Decomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Nicolas Trotignon
TVCG
2011
100views more  TVCG 2011»
14 years 11 months ago
Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths
—Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place t...
Daniel Archambault, Tamara Munzner, David Auber
ICSE
2009
IEEE-ACM
16 years 5 months ago
Discovering and representing systematic code changes
Software engineers often inspect program differences when reviewing others' code changes, when writing check-in comments, or when determining why a program behaves differentl...
Miryung Kim, David Notkin
SDM
2009
SIAM
124views Data Mining» more  SDM 2009»
16 years 1 months ago
Non-parametric Information-Theoretic Measures of One-Dimensional Distribution Functions from Continuous Time Series.
We study non-parametric measures for the problem of comparing distributions, which arise in anomaly detection for continuous time series. Non-parametric measures take two distribu...
Ali Dasdan, Paolo D'Alberto