1389 search results - page 62 / 278 » Parallel Algorithms for Treewidth Two |
108
click to vote
COMPSAC
2005
IEEE
15 years 10 months ago
2005
IEEE
Parallel changes are a basic fact of modern software development. Where previously we looked at prima facie interference, here we investigate a less direct form that we call seman...
132
click to vote
STOC
1995
ACM
15 years 8 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
131
click to vote
WSC
2007
15 years 6 months ago
2007
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
138
click to vote
MCS
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we present a fusion technique for Support Vector Machine (SVM) scores, obtained after a dimension reduction with Bilateralprojection-based Two-Dimensional Principal C...
138
click to vote
DGCI
2006
Springer
15 years 8 months ago
2006
Springer
Critical kernels constitute a general framework settled in the of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of thi...