Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
High-Level Languages (HLLs) for FPGAs (FieldProgrammable Gate Arrays) facilitate the use of reconfigurable computing resources for application developers by using familiar, higher...
John Curreri, Seth Koehler, Brian Holland, Alan D....
Many efforts in Grid communities have focused on middleware research and development. However, Grid application-level tools are needed which can build higherlevel functionality on...
The vast majority of research projects involving Grid Computing have focused on the development and standardization of the middleware that allows Grids to function. Despite the ma...
Santiago Pena, Dayong Huang, Zhou Lei, Gabrielle A...
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...