Sciweavers

10055 search results - page 267 / 2011
» Structured programming using processes
Sort
View
139
Voted
JMLR
2012
13 years 2 months ago
Universal Measurement Bounds for Structured Sparse Signal Recovery
Standard compressive sensing results state that to exactly recover an s sparse signal in Rp , one requires O(s · log p) measurements. While this bound is extremely useful in prac...
Nikhil S. Rao, Ben Recht, Robert D. Nowak
WCET
2008
15 years 1 months ago
A tool for average and worst-case execution time analysis
We have developed a new programming paradigm which, for conforming programs, allows the averagecase execution time (ACET) to be obtained automatically by a static analysis. This i...
David Hickey, Diarmuid Early, Michel P. Schelleken...
118
Voted
BMCBI
2006
105views more  BMCBI 2006»
15 years 14 days ago
CRNPRED: highly accurate prediction of one-dimensional protein structures by large-scale critical random networks
Background: One-dimensional protein structures such as secondary structures or contact numbers are useful for three-dimensional structure prediction and helpful for intuitive unde...
Akira R. Kinjo, Ken Nishikawa
75
Voted
CONCUR
2010
Springer
15 years 1 months ago
A Geometric Approach to the Problem of Unique Decomposition of Processes
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
Thibaut Balabonski, Emmanuel Haucourt
108
Voted
IJPRAI
2010
105views more  IJPRAI 2010»
14 years 9 months ago
An Ontology-Based Model for Representing Image Processing Application Objectives
This paper investigates what kinds of information are necessary and sufficient to design and evaluate image processing software programs and proposes a representation of these inf...
Régis Clouard, Arnaud Renouf, Marinette Rev...