Sciweavers

2477 search results - page 177 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
PAAPP
2006
44views more  PAAPP 2006»
15 years 6 months ago
Revisiting communication code generation algorithms for message-passing systems
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
Clayton S. Ferner
ICCV
2009
IEEE
15 years 3 months ago
Realtime background subtraction from dynamic scenes
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...
Li Cheng, Minglun Gong
WWW
2008
ACM
16 years 6 months ago
Sewnet -: a framework for creating services utilizing telecom functionality
With Telecom market reaching saturation in many geographies and revenues from voice calls decreasing, Telecom operators are trying to identify new sources of revenue. For this pur...
Sumit Mittal, Dipanjan Chakraborty, Sunil Goyal, S...
EMSOFT
2006
Springer
15 years 9 months ago
Scheduling-independent threads and exceptions in SHIM
Concurrent programming languages should be a good fit for embedded systems because they match the intrinsic parallelism of their architectures and environments. Unfortunately, typ...
Olivier Tardieu, Stephen A. Edwards
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 6 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...