5105 search results - page 333 / 1021 » Approximate Structural Consistency |
182
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
166
click to vote
CSFW
2007
IEEE
16 years 1 months ago
2007
IEEE
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
177
click to vote
SAC
2006
ACM
16 years 19 days 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...
175
click to vote
IFIP
2004
Springer
16 years 2 days 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...
162
click to vote
ISAAC
2004
Springer
16 years 2 days ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...