Sciweavers

2904 search results - page 234 / 581
» Number Forms in the Brain
Sort
View
CC
2009
Springer
190views System Software» more  CC 2009»
16 years 8 months ago
SSA Elimination after Register Allocation
form uses a notational abstractions called -functions. These instructions have no analogous in actual machine instruction sets, and they must be replaced by ordinary instructions ...
Fernando Magno Quintão Pereira, Jens Palsbe...
PPOPP
2009
ACM
16 years 7 months ago
How much parallelism is there in irregular applications?
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
16 years 7 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
VLSID
2004
IEEE
292views VLSI» more  VLSID 2004»
16 years 7 months ago
NoCGEN: A Template Based Reuse Methodology for Networks on Chip Architecture
In this paper, we describe NoCGEN, a Network On Chip (NoC) generator, which is used to create a simulatable and synthesizable NoC description. NoCGEN uses a set of modularised rou...
Jeremy Chan, Sri Parameswaran
STOC
2006
ACM
83views Algorithms» more  STOC 2006»
16 years 7 months ago
A randomized polynomial-time simplex algorithm for linear programming
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
Jonathan A. Kelner, Daniel A. Spielman