Sciweavers

1794 search results - page 94 / 359
» Visualizing Memory Graphs
Sort
View
144
Voted
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
16 years 4 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
PLDI
2004
ACM
15 years 9 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta
144
Voted
ISSS
2000
IEEE
127views Hardware» more  ISSS 2000»
15 years 7 months ago
Low Power Storage Cycle Budget Distribution Tool Support for Hierarchical Graphs
In data dominated applications, like multi-media and telecom applications, data storage and transfers are the most important factors in terms of energy consumption, area and syste...
Erik Brockmeyer, Arnout Vandecappelle, Sven Wuytac...
147
Voted
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 3 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
VISUALIZATION
2000
IEEE
15 years 8 months ago
Multi-user view-dependent rendering
In this paper we are presenting a novel architecture which allows rendering of large-shared dataset at interactive rates on an inexpensive workstation. The idea is based on view-d...
Jihad El-Sana