1520 search results - page 210 / 304 » The Ring Loading Problem |
126
click to vote
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
134
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
121
click to vote
GLOBECOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
142
click to vote
MMB
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
136
click to vote
ISCA
1993
IEEE
15 years 7 months ago
1993
IEEE
The distribution of resources among processors, memory and caches is a crucial question faced by designers of large-scale parallel machines. If a machine is to solve problems with...