324 search results - page 18 / 65 » Distance Approximating Trees: Complexity and Algorithms |
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
ECAL
2001
Springer
15 years 4 months ago
2001
Springer
In this paper a formal approach to construction of a similarity measure for complex creatures is presented. The simulation model is described, and a Framsticks agent is expressed i...
105
click to vote
IWOCA
2009
Springer
15 years 6 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
106
click to vote
IPSN
2009
Springer
15 years 6 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...