Sciweavers

787 search results - page 85 / 158
» Polynomial Constants are Decidable
Sort
View
PERCOM
2006
ACM
14 years 9 months ago
Maximum Weighted Matching with Interference Constraints
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
Gaurav Sharma, Ness B. Shroff, Ravi R. Mazumdar
GLOBECOM
2009
IEEE
14 years 4 months ago
Feasibility Conditions for Interference Alignment
—The degrees of freedom (DoF) of K-user MIMO interference networks with constant channel coefficients are not known in general. Determining the feasibility of a linear interfere...
Cenk M. Yetis, Tiangao Gou, Syed Ali Jafar, Ahmet ...
IPPS
2009
IEEE
14 years 4 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...
MFCS
2007
Springer
14 years 3 months ago
On Approximation of Bookmark Assignments
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hir...
CCS
2003
ACM
14 years 2 months ago
k-anonymous message transmission
Informally, a communication protocol is sender k - anonymous if it can guarantee that an adversary, trying to determine the sender of a particular message, can only narrow down it...
Luis von Ahn, Andrew Bortz, Nicholas J. Hopper