1647 search results - page 157 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
158
click to vote
ISPD
2009
ACM
15 years 12 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
118
click to vote
ICIP
2009
IEEE
15 years 2 months ago
2009
IEEE
This paper addresses fluorescence diffuse optical tomography (FDOT) reconstruction problem with a priori information. We assume that approximate location of the fluorophore concen...
143
click to vote
IJCAI
2007
15 years 6 months ago
2007
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task ...
147
click to vote
MP
2007
15 years 4 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
135
Voted
STACS
2007
Springer
15 years 11 months ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...