Sciweavers

1986 search results - page 338 / 398
» Path Separability of Graphs
Sort
View
DAC
2006
ACM
14 years 8 months ago
Criticality computation in parameterized statistical timing
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
Jinjun Xiong, Vladimir Zolotov, Natesan Venkateswa...
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 8 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
WWW
2008
ACM
14 years 8 months ago
Statistical analysis of the social network and discussion threads in slashdot
We analyze the social network emerging from the user comment activity on the website Slashdot. The network presents common features of traditional social networks such as a giant ...
Andreas Kaltenbrunner, Vicenç Gómez,...
WWW
2005
ACM
14 years 8 months ago
Popular web hot spots identification and visualization
This work aims a two-fold contribution: it presents a software to analyse logfiles and visualize popular web hot spots and, additionally, presents an algorithm to use this informa...
D. Avramouli, John D. Garofalakis, Dimitris J. Kav...
VLSID
2002
IEEE
94views VLSI» more  VLSID 2002»
14 years 8 months ago
A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design
In floorplan design, it is common that a designer will want to control the positions of some modules in the final packing for various purposes like data path alignment, I/O connec...
Evangeline F. Y. Young, Chris C. N. Chu, M. L. Ho