6568 search results - page 353 / 1314 » Reducing the Complexity of Reductions |
184
Voted
TIP
2002
15 years 7 months ago
2002
In this correspondence, we prove that the affine invariants proposed recently by Yang and Cohen [1] are algebraically dependent. We show how to select an independent and complete s...
182
Voted
NAACL
2010
15 years 5 months ago
2010
In this work, we try a hybrid methodology for language modeling where both morphological decomposition and factored language modeling (FLM) are exploited to deal with the complex ...
145
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
224
Voted
ICPR
2000
IEEE
15 years 12 months ago
2000
IEEE
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
210
click to vote
IPPS
1999
IEEE
15 years 12 months ago
1999
IEEE
We study how several collective operations like broadcast, reduction, scan, etc. can be composed efficiently in complex parallel programs. Our specific contributions are: (1) a fo...