Sciweavers

672 search results - page 25 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 7 months ago
Developing courses with HoloRena, a framework for scenario- and game based e-learning environments
However utilizing rich, interactive solutions can make learning more effective and attractive, scenarioand game-based educational resources on the web are not widely used. Creatin...
Laszlo Juracz
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 8 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
VIZSEC
2004
Springer
14 years 26 days ago
Managing attack graph complexity through visual hierarchical aggregation
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
Steven Noel, Sushil Jajodia
MICS
2010
124views more  MICS 2010»
13 years 2 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
IUI
2009
ACM
14 years 4 months ago
Learning to generalize for complex selection tasks
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
Alan Ritter, Sumit Basu