8298 search results - page 1337 / 1660 » On the Complexity of Numerical Analysis |
177
click to vote
SCAM
2006
IEEE
16 years 25 days ago
2006
IEEE
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
185
click to vote
SIPS
2006
IEEE
16 years 25 days ago
2006
IEEE
—A wide variety of DSP design tools have been developed that incorporate dataflow graph representations into their GUI-based design environments. However, as the complexity of ap...
154
click to vote
SIPS
2006
IEEE
16 years 25 days ago
2006
IEEE
Although many stopping methods of iterative decoding have been discussed in the literatures extensively, many of them only focus on the solvable decoding. In this paper, we propos...
161
click to vote
SKG
2006
IEEE
16 years 25 days ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...
145
click to vote
WCRE
2006
IEEE
16 years 25 days ago
2006
IEEE
Software applications typically have many features that vary in their similarity. We define a measurement of similarity between pairs of features based on their underlying implem...