Sciweavers

150 search results - page 29 / 30
» New Bounds for Codes Identifying Vertices in Graphs
Sort
View
IPPS
2006
IEEE
13 years 12 months ago
Speeding up NGB with distributed file streaming framework
Grid computing provides a very rich environment for scientific calculations. In addition to the challenges it provides, it also offers new opportunities for optimization. In this ...
Bingchen Li, Kang Chen, Zhiteng Huang, H. L. Rajic...
EMSOFT
2009
Springer
13 years 9 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
PLDI
2011
ACM
12 years 8 months ago
Isolating and understanding concurrency errors using reconstructed execution fragments
In this paper we propose Recon, a new general approach to concurrency debugging. Recon goes beyond just detecting bugs, it also presents to the programmer short fragments of buggy...
Brandon Lucia, Benjamin P. Wood, Luis Ceze
EUROSYS
2010
ACM
13 years 12 months ago
PUSH: A Dataflow Shell
The deluge of huge data sets such as those provided by sensor networks, online transactions, and the web provide exciting opportunities for data analysis. The scale of the data ...
Noah Evans, Eric Van Hensbergen
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 5 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris