Sciweavers

4835 search results - page 171 / 967
» Refactoring Functional Programs
Sort
View
CONSTRAINTS
2008
138views more  CONSTRAINTS 2008»
14 years 10 months ago
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Martin C. Cooper
ANSS
2006
IEEE
15 years 4 months ago
Performance Enhancement by Eliminating Redundant Function Execution
Programs often call the same function with the same arguments, yielding the same results. We call this phenomenon, “function reuse”. Previously, we have shown such a behavior ...
Peng Chen, Krishna M. Kavi, Robert Akl
84
Voted
HICSS
2006
IEEE
135views Biometrics» more  HICSS 2006»
15 years 4 months ago
Using Function Generalization to Design a Cosequential Processing Framework
Abstract— Framework design is a multifaceted endeavor undertaken to promote reuse of software within a family of related applications. Traditional approaches involve either the e...
H. Conrad Cunningham, Pallavi Tadepalli
82
Voted
CATA
2003
14 years 11 months ago
Implementation and Performance Evaluation of Intel VTUNE Image Processing Functions in the MATLAB Environment
Many current general purpose processors use extensions to the instruction set architecture to enhance the performance of digital image processing and multimedia applications. In t...
Phaisit Chewputtanagul, David Jeff Jackson, Kennet...
101
Voted
ACL
2010
14 years 8 months ago
Hard Constraints for Grammatical Function Labelling
For languages with (semi-) free word order (such as German), labelling grammatical functions on top of phrase-structural constituent analyses is crucial for making them interpreta...
Wolfgang Seeker, Ines Rehbein, Jonas Kuhn, Josef v...