Sciweavers

211 search results - page 38 / 43
» Optimality Theory and the Generative Complexity of Constrain...
Sort
View
CASES
2006
ACM
15 years 6 months ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
15 years 2 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
117
Voted
BMCBI
2007
166views more  BMCBI 2007»
15 years 8 days ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
PASTE
2005
ACM
15 years 5 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen
SIGGRAPH
2010
ACM
15 years 4 months ago
Paneling architectural freeform surfaces
The emergence of large-scale freeform shapes in architecture poses big challenges to the fabrication of such structures. A key problem is the approximation of the design surface b...
Michael Eigensatz, Martin Kilian, Alexander Schift...