Sciweavers

1182 search results - page 231 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
CCR
2002
102views more  CCR 2002»
13 years 7 months ago
DNS performance and the effectiveness of caching
This paper presents a detailed analysis of traces of DNS and associated TCP traffic collected on the Internet links of the MIT Laboratory for Computer Science and the Korea Advance...
Jaeyeon Jung, Emil Sit, Hari Balakrishnan, Robert ...
ACRI
2010
Springer
13 years 6 months ago
The Complexity of Three-Dimensional Critical Avalanches
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
Carolina Mejía, J. Andrés Montoya
ICCAD
2009
IEEE
151views Hardware» more  ICCAD 2009»
13 years 5 months ago
Timing yield-aware color reassignment and detailed placement perturbation for double patterning lithography
Double patterning lithography (DPL) is a likely resolution enhancement technique for IC production in 32nm and below technology nodes. However, DPL gives rise to two independent, ...
Mohit Gupta, Kwangok Jeong, Andrew B. Kahng
GIS
2005
ACM
14 years 8 months ago
Adaptive nearest neighbor queries in travel time networks
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance informatio...
Wei-Shinn Ku, Roger Zimmermann, Haojun Wang, Chi-N...
KDD
2004
ACM
138views Data Mining» more  KDD 2004»
14 years 7 months ago
IDR/QR: an incremental dimension reduction algorithm via QR decomposition
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Ja...