1101 search results - page 174 / 221 » An Algorithm for the Graph Crossing Number Problem |
106
click to vote
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
120
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
114
click to vote
DAC
1994
ACM
15 years 6 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
132
click to vote
STOC
1995
ACM
15 years 5 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
129
click to vote
DICTA
2003
15 years 3 months ago
2003
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We for...