2636 search results - page 367 / 528 » Linear Programming |
148
click to vote
CONCUR
2007
Springer
16 years 20 days ago
2007
Springer
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
140
click to vote
PLDI
2005
ACM
16 years 2 days ago
2005
ACM
A critical optimization in the domain of linear signal transforms, such as the discrete Fourier transform (DFT), is loop merging, which increases data locality and reuse and thus ...
155
click to vote
COCO
2005
Springer
16 years 1 days ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
148
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
171
click to vote
ASPLOS
1992
ACM
15 years 10 months ago
1992
ACM
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...