2489 search results - page 100 / 498 » On the Subgroup Distance Problem |
125
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
180
click to vote
TSMC
2010
14 years 10 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
173
click to vote
ESE
2000
15 years 3 months ago
2000
Problem frames are a relatively new approach to requirements engineering, promising benefits not only in elicitation but also in subsequent design, by allowing their users to selec...
158
click to vote
ANOR
2007
15 years 4 months ago
2007
The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applicat...
118
click to vote
JCO
2010
15 years 2 months ago
2010
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...