1101 search results - page 118 / 221 » An Algorithm for the Graph Crossing Number Problem |
185
click to vote
MOBICOM
2006
ACM
15 years 11 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
129
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
141
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
146
Voted
PC
2000
15 years 4 months ago
2000
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
197
click to vote
SIROCCO
1997
15 years 6 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...