Sciweavers

4940 search results - page 526 / 988
» On the Complexity of Universal Programs
Sort
View
DATE
1999
IEEE
120views Hardware» more  DATE 1999»
15 years 11 months ago
Hardware Synthesis from C/C++ Models
Software programming languages, such as C/C++, have been used as means for specifying hardware for quite a while. Different design methodologies have exploited the advantages of f...
Giovanni De Micheli
WSC
1994
15 years 8 months ago
General purpose simulation with stroboscope
Stroboscope is a programming language designed for the simulation of processes common to construction engineering. These processes are very complex and involve many different type...
Julio C. Martínez, Photios G. Ioannou
BMCBI
2010
145views more  BMCBI 2010»
15 years 7 months ago
WaveletQuant, an improved quantification software based on wavelet signal threshold de-noising for labeled quantitative proteomi
Background: Quantitative proteomics technologies have been developed to comprehensively identify and quantify proteins in two or more complex samples. Quantitative proteomics base...
Fan Mo, Qun Mo, Yuanyuan Chen, David R. Goodlett, ...
SIAMSC
2010
116views more  SIAMSC 2010»
15 years 5 months ago
Recursively Accelerated Multilevel Aggregation for Markov Chains
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...
Hans De Sterck, K. Miller, G. Sanders, M. Winlaw
ICALP
2011
Springer
14 years 10 months ago
Improved Approximation for the Directed Spanner Problem
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...