Sciweavers

1458 search results - page 65 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
102
Voted
APVIS
2009
15 years 6 months ago
Point-based tree representation: A new approach for large hierarchies
Space-filling layout techniques for tree representations are frequently used when the available screen space is small or the data set is large. In this paper, we propose a new app...
Hans-Jörg Schulz, Steffen Hadlak, Heidrun Sch...
TVCG
2011
132views more  TVCG 2011»
14 years 11 months ago
Point-Based Visualization for Large Hierarchies
—Space-filling layout techniques for tree representations are frequently used when the available screen space is small or the data set is large. In this paper, we propose an ef...
Hans-Jörg Schulz, Steffen Hadlak, Heidrun Sch...
VIIP
2001
15 years 6 months ago
Visual Behavior Characterization for Intrusion Detection in Large Scale Systems
This work focuses on the visual representation of relations towards aiding the exploration and analysis of network intrusions. Fundamentally, the visual representations aid an ana...
Robert F. Erbacher
SEMWEB
2010
Springer
15 years 2 months ago
Optimize First, Buy Later: Analyzing Metrics to Ramp-Up Very Large Knowledge Bases
As knowledge bases move into the landscape of larger ontologies and have terabytes of related data, we must work on optimizing the performance of our tools. We are easily tempted t...
Paea LePendu, Natalya Fridman Noy, Clement Jonquet...
JUCS
2008
130views more  JUCS 2008»
15 years 4 months ago
Feature Selection for the Classification of Large Document Collections
: Feature selection methods are often applied in the context of document classification. They are particularly important for processing large data sets that may contain millions of...
Janez Brank, Dunja Mladenic, Marko Grobelnik, Nata...