Sciweavers

4781 search results - page 753 / 957
» Online algorithms for network design
Sort
View
IFIP
2004
Springer
15 years 12 months ago
Solving Packing Problem with Weaker Block Solvers
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...
Hu Zhang
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
15 years 8 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
DAIS
2009
15 years 7 months ago
Fault-Tolerant Aggregation by Flow Updating
Data aggregation plays an important role in the design of scalable systems, allowing the determination of meaningful system-wide properties to direct the execution of distributed a...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
CVPR
2003
IEEE
16 years 8 months ago
Using Many Cameras as One
We illustrate how to consider a network of cameras as a single generalized camera in a framework proposed by Nayar [13]. We derive the discrete structure from motion equations for...
Robert Pless
ICIP
2002
IEEE
16 years 8 months ago
A window-based color quantization technique and its embedded implementation
A new color quantization (CQ) technique and its VLSI implementation is introduced. It is based on image split into windows and uses Kohonen Self Organized Neural Network Classifie...
Antonios Atsalakis, Nikos Papamarkos, Dimitrios So...