613 search results - page 35 / 123 » The Model-Summary Problem and a Solution for Trees |
SIAMCOMP
2008
13 years 7 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
MOR
2010
13 years 5 months ago
2010
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we propose a distributed solution to the problem of configuring classifier trees in distributed stream mining systems. The configuration involves selecting appro...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...