Sciweavers

824 search results - page 84 / 165
» Weighted Low-Rank Approximations
Sort
View
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
15 years 2 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
MOBIHOC
2007
ACM
15 years 9 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
ICC
2007
IEEE
165views Communications» more  ICC 2007»
15 years 4 months ago
Capacity Analysis of MIMO System Over Identically Independent Distributed Weibull Fading Channels
— The capacity of multiple input multiple output (MIMO) system over wireless channels has been investigated analytically and by simulation over different types of wireless fading...
Ibrahim Y. Abualhaol, Mustafa M. Matalgah
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
15 years 3 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
FOCS
2004
IEEE
15 years 1 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor