2373 search results - page 244 / 475 » On the Theory of Structural Subtyping |
164
Voted
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
179
click to vote
IPPS
2006
IEEE
16 years 22 days ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
188
click to vote
PPOPP
2005
ACM
16 years 8 days ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
161
click to vote
SPAA
2005
ACM
16 years 8 days ago
2005
ACM
This paper shows for the first time that elimination, a scaling technique formerly applied only to counters and LIFO structures, can be applied to FIFO data structures, specific...
161
click to vote
CALCO
2005
Springer
16 years 7 days ago
2005
Springer
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...