79 search results - page 7 / 16 » On condition numbers of polynomial eigenvalue problems |
JCO
2010
13 years 7 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...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
SIGECOM
2004
ACM
14 years 2 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
ICPP
2006
IEEE
14 years 2 months ago
2006
IEEE
Modeling the performance behavior of parallel applications to predict the execution times of the applications for larger problem sizes and number of processors has been an active ...
ICCV
2005
IEEE
14 years 2 months ago
2005
IEEE
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...