Sciweavers

2060 search results - page 8 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
CODES
2010
IEEE
14 years 7 months ago
Improving platform-based system synthesis by satisfiability modulo theories solving
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
Felix Reimann, Michael Glaß, Christian Haube...
76
Voted
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 9 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
VIS
2007
IEEE
115views Visualization» more  VIS 2007»
15 years 11 months ago
Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications
Abstract--The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and ana...
Christoph Garth, Florian Gerhardt, Xavier Tricoc...
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 9 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert
IPPS
1998
IEEE
15 years 1 months ago
Using PI/OT to Support Complex Parallel I/O
This paper describes PI/OT, a template-based parallel I/O system. In PI/OT, I/O streams have annotations associated with them that are external to the source code. These annotatio...
Ian Parsons, Jonathan Schaeffer, Duane Szafron, Ro...