Sciweavers

1545 search results - page 268 / 309
» On tree congestion of graphs
Sort
View
GRAPHICSINTERFACE
2007
15 years 7 months ago
Can smooth view transitions facilitate perceptual constancy in node-link diagrams?
Many visualizations use smoothly animated transitions to help the user interact with information structures. These transitions are intended to preserve perceptual constancy during...
Maruthappan Shanmugasundaram, Pourang Irani, Carl ...
PLDI
2012
ACM
13 years 8 months ago
Parallelizing top-down interprocedural analyses
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sri...
FOCS
2008
IEEE
16 years 18 days ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
16 years 9 days ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
SENSYS
2006
ACM
16 years 2 days ago
Scalable data aggregation for dynamic events in sensor networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
Kai-Wei Fan, Sha Liu, Prasun Sinha