Sciweavers

322 search results - page 35 / 65
» Algorithms for Large Integer Matrix Problems
Sort
View
DAC
2006
ACM
14 years 8 months ago
Optimal cell flipping in placement and floorplanning
In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solv...
Chiu-Wing Sham, Evangeline F. Y. Young, Chris C. N...
ICDCS
2009
IEEE
14 years 4 months ago
Optimizing File Retrieval in Delay-Tolerant Content Distribution Community
In WiFi-based content distribution community infrastructure (CDCI), file servers are deployed in diverse locations around cities, caching popular files interesting to a communit...
Ying Huang, Yan Gao, Klara Nahrstedt, Wenbo He
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
14 years 2 months ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
13 years 2 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan
FSTTCS
2010
Springer
13 years 5 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...