804 search results - page 143 / 161 » Algorithms for Programmers |
102
click to vote
FCCM
1999
IEEE
15 years 4 months ago
1999
IEEE
The time it takes to reconfigure FPGAs can be a significant overhead for reconfigurable computing. In this paper we develop new compression algorithms for FPGA configurations that...
126
click to vote
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
118
Voted
AUSDM
2008
Springer
15 years 1 months ago
2008
Springer
The exceptional growth of graphics hardware in programmability and data processing speed in the past few years has fuelled extensive research in using it for general purpose compu...
120
click to vote
DLS
2005
15 years 1 months ago
2005
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
WCE
2007
15 years 26 days ago
2007
— This paper presents an important outcome of a research programme which focuses on the development of a method for synthesizing, under controlled conditions in the laboratory, t...