Sciweavers

1594 search results - page 32 / 319
» Visualizing Program Executions on Large Data Sets
Sort
View
CHI
2003
ACM
14 years 9 months ago
Efficient user interest estimation in fisheye views
We present a new technique for efficiently computing Degree-of-Interest distributions to inform the visualization of graph-structured data. The technique is independent of the int...
Jeffrey Heer, Stuart K. Card
ASPLOS
2000
ACM
14 years 1 months ago
Frequent Value Locality and Value-Centric Data Cache Design
By studying the behavior of programs in the SPECint95 suite we observed that six out of eight programs exhibit a new kind of value locality, the frequent value locality, according...
Youtao Zhang, Jun Yang 0002, Rajiv Gupta
DEXAW
2010
IEEE
204views Database» more  DEXAW 2010»
13 years 10 months ago
Scalable Recursive Top-Down Hierarchical Clustering Approach with Implicit Model Selection for Textual Data Sets
Automatic generation of taxonomies can be useful for a wide area of applications. In our application scenario a topical hierarchy should be constructed reasonably fast from a large...
Markus Muhr, Vedran Sabol, Michael Granitzer
VISSOFT
2002
IEEE
14 years 1 months ago
Specifying Algorithm Visualizations in Terms of Data Flow
Interesting events and state mapping are two approaches used to specify software visualization. They are applied in, respectively, event-driven and data-driven visualization syste...
Jaroslaw Francik
FASE
2006
Springer
14 years 13 days ago
Automated Systematic Testing of Open Distributed Programs
We present an algorithm for automatic testing of distributed programs, such as Unix processes with inter-process communication and Web services. Specifically, we assume that a prog...
Koushik Sen, Gul Agha