1594 search results - page 186 / 319 » An Algorithm to Compute Collusion Paths |
127
Voted
PR
2007
15 years 3 months ago
2007
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
133
click to vote
ANCS
2009
ACM
15 years 1 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
131
Voted
ICML
1997
IEEE
16 years 4 months ago
1997
IEEE
Machine learning techniques are applicable to computer system optimization. We show that shared memory multiprocessors can successfully utilize machine learning algorithms for mem...
146
Voted
COCO
1998
Springer
15 years 7 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
125
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...