1405 search results - page 65 / 281 » Popularity at Minimum Cost |
INFORMS
2008
14 years 9 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
JMLR
2006
14 years 9 months ago
2006
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
NETWORKS
2008
14 years 9 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
TASLP
2008
14 years 9 months ago
2008
We propose a new family of Bayesian estimators for speech enhancement where the cost function includes both a power law and a weighting factor. The parameters of the cost function,...
TSP
2008
14 years 9 months ago
2008
Designing matched transmit and receive filters such that their combination satisfies the Nyquist condition is a classical problem in digital communication systems. In this paper, ...