1542 search results - page 95 / 309 » Kernelization of packing problems |
109
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
ICCAD
2007
IEEE
15 years 10 months ago
2007
IEEE
— In order to reduce parasitic mismatch in analog circuits, some groups of devices are required to share a common centroid while being placed. Devices are split into smaller ones...
119
click to vote
ISSS
1999
IEEE
15 years 5 months ago
1999
IEEE
Decreasing the program size has become an important goal in the design of embedded systems target to mass production. This problem has led to a number of efforts aimed at designin...
108
click to vote
CIE
2008
Springer
15 years 3 months ago
2008
Springer
Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet that satisfy some given condition P on the asympt...
106
click to vote
ICS
2000
Tsinghua U.
15 years 5 months ago
2000
Tsinghua U.
Complete system simulation to understand the influence of architecture and operating systems on application execution has been identified to be crucial for systems design. While t...