2489 search results - page 258 / 498 » On the Subgroup Distance Problem |
114
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
115
Voted
AUTOMATICA
2007
15 years 4 months ago
2007
— A pair of spins is the most simple quantum system that can possess entanglement, a non-classical property playing an essential role in quantum information technologies. In this...
123
click to vote
GEOINFORMATICA
2006
15 years 4 months ago
2006
Existing estimation approaches for spatial databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, the...
132
click to vote
JDA
2007
15 years 4 months ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
136
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...