4926 search results - page 552 / 986 » Two Graph Algorithms On an Associative Computing Model |
241
click to vote
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
114
click to vote
SMA
2005
ACM
15 years 9 months ago
2005
ACM
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
TSP
2008
15 years 3 months ago
2008
We present a reduced-complexity soft detection (RCSD) scheme geared to multiple-input multiple-output (MIMO) systems with spatial domain multiplexing leading to layered space-time ...
123
Voted
IEEEPACT
2009
IEEE
15 years 10 months ago
2009
IEEE
Parallel programming is a requirement in the multi-core era. One of the most promising techniques to make parallel programming available for the general users is the use of parall...
139
click to vote
CSR
2009
Springer
15 years 10 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...