734 search results - page 147 / 147 » A polynomial quantum algorithm for approximating the Jones p... |
ALGOSENSORS
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
SIAMDM
2010
12 years 12 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
TCBB
2010
2010
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
12 years 12 months ago
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
COCO
2010
Springer
13 years 6 months ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...