1101 search results - page 92 / 221 » An Algorithm for the Graph Crossing Number Problem |
157
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
182
click to vote
TWC
2010
14 years 11 months ago
2010
This paper deals with distributed demodulation of space-time transmissions of a common message from a multiantenna access point (AP) to a wireless sensor network. Based on local me...
135
click to vote
IJAC
2007
15 years 4 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
156
click to vote
EMMCVPR
2003
Springer
15 years 10 months ago
2003
Springer
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...
125
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...