1388 search results - page 157 / 278 » Approximability of Robust Network Design |
134
click to vote
ICNP
2005
IEEE
15 years 9 months ago
2005
IEEE
Access links are typically the bottleneck between a high bandwidth LAN and a high bandwidth IP network. Without a priori resource provisioning or reservation, this tends to have a...
142
click to vote
DAC
2009
ACM
15 years 7 months ago
2009
ACM
Structured ASICs have recently emerged as an exciting alternative to ASIC or FPGA design style as they provide a new trade-off between the high performance of ASIC design and low ...
134
Voted
SAC
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...
143
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
137
Voted
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
In this paper, we present a shape constrained Markov network for accurate face alignment. The global face shape is defined as a set of weighted shape samples which are integrated ...