1225 search results - page 55 / 245 » Maximal Consistent Subsets |
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
IWANN
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. In this paper we address the problem of blind source extraction of a subset of “interesting” independent sources from a linear convolutive or instantaneous mixture. T...
ERSHOV
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Existing partial evaluators usually fix the strategy for binding-time analysis. But a single strategy cannot fulfill all goals without leading to compromises regarding ...
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
OPODIS
2008
14 years 11 months ago
2008
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...