Sciweavers

4850 search results - page 77 / 970
» Approximate Data Structures with Applications
Sort
View
IV
2003
IEEE
98views Visualization» more  IV 2003»
15 years 3 months ago
The Stardinates - Visualizing Highly Structured Data
The Stardinates are a novel interactive Information Visualization (InfoVis) technique which aims at visualizing highly structured data. They represent some Gestalt principles very...
Monika Lanzenberger, Silvia Miksch, Margit Pohl
IMC
2006
ACM
15 years 3 months ago
Semi-automated discovery of application session structure
While the problem of analyzing network traffic at the granularity of individual connections has seen considerable previous work and tool development, understanding traffic at a ...
Jayanthkumar Kannan, Jaeyeon Jung, Vern Paxson, Ca...
IJHPCA
2006
122views more  IJHPCA 2006»
14 years 10 months ago
A New Hardware Monitor Design to Measure Data Structure-Specific Cache Eviction Information
In this paper, we propose a hardware performance monitor that provides support not only for measuring cache misses and the addresses associated with them, but also for determining...
Bryan R. Buck, Jeffrey K. Hollingsworth
RSCTC
2000
Springer
147views Fuzzy Logic» more  RSCTC 2000»
15 years 1 months ago
Towards Rough Neural Computing Based on Rough Membership Functions: Theory and Application
This paper introduces a neural network architecture based on rough sets and rough membership functions. The neurons of such networks instantiate approximate reasoning in assessing ...
James F. Peters, Andrzej Skowron, Liting Han, Shee...
PLDI
2010
ACM
15 years 2 months ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...