181
click to vote
FS
2016
10 years 4 hour ago
2016
In a model independent discrete time financial market, we discuss the richness of the family of martingale measures in relation to different notions of Arbitrage, generated by a...
308
click to vote
FPGA
2016
ACM
10 years 4 hour ago
2016
ACM
The advent of FPGA acceleration platforms with direct coherent access to processor memory creates an opportunity for accelerating applications with irregular parallelism governed ...
215
click to vote
FPGA
2016
ACM
10 years 4 hour ago
2016
ACM
Loops are pervasive in numerical programs, so high-level synthesis (HLS) tools use state-of-the-art scheduling techniques to pipeline them efficiently. Still, the run time perform...
155
click to vote
FPGA
2016
ACM
10 years 4 hour ago
2016
ACM
In theory, tools like VTR—a retargetable toolchain mapping circuits onto easily-described hypothetical FPGA architectures—could play a key role in the development of wildly in...
170
click to vote
FPGA
2016
ACM
10 years 4 hour ago
2016
ACM
Sparse matrix vector multiplication (SpMV) is an important kernel in many scientific applications. To improve the performance and applicability of FPGA based SpMV, we propose an ...
188
click to vote
FPGA
2016
ACM
10 years 4 hour ago
2016
ACM
We provide a case study of work-stealing, a popular method for run-time load balancing, on FPGAs. Following the Cederman–Tsigas implementation for GPUs, we synchronize workitems...
270
click to vote
FPGA
2016
ACM
10 years 4 hour ago
2016
ACM
Field Programmable Gate Array (FPGA) implementations of sorting algorithms have proven to be efficient, but existing implementations lack portability and maintainability because t...
149
click to vote
FPGA
2016
ACM
10 years 4 hour ago
2016
ACM
Bitwidth optimization of FPGA datapaths can save hardware resources by choosing the fewest number of bits required for each datapath variable to achieve a desired quality of resul...
116
click to vote
FOSSACS
2016
Springer
10 years 4 hour ago
2016
Springer
Abstract. We extend the concept of a synchronizing word from finitestate automata (DFA) to nested word automata (NWA): A well-matched nested word is called synchronizing if it res...
116
click to vote
FOSSACS
2016
Springer
10 years 4 hour ago
2016
Springer
We investigate the complexity of deciding contextual approximation (refinement) in finitary Idealized Algol, a prototypical language combining higherorder types with state. Earli...