1542 search results - page 36 / 309 » Kernelization of packing problems |
ICASSP
2010
IEEE
15 years 12 hour ago
2010
IEEE
The sequence kernel has been shown to be a promising kernel function for learning from sequential data such as speech and DNA. However, it is not scalable to massive datasets due ...
103
click to vote
WADS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
ESA
2005
Springer
15 years 5 months ago
2005
Springer
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
IJCAI
2003
15 years 1 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
—Every year the computing resources available on dynamically partially reconfigurable devices increase enormously. In the near future, we expect many applications to run on a si...