1068 search results - page 186 / 214 » Factorization as a Rank 1 Problem |
112
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
118
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
106
click to vote
SECON
2008
IEEE
15 years 8 months ago
2008
IEEE
—Traffic routing plays a critical role in determining the performance of a wireless mesh network. To investigate the best solution, existing work proposes to formulate the mesh ...
103
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
104
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...