Sciweavers

1145 search results - page 178 / 229
» The Correctness of an Optimized Code Generation
Sort
View
APL
1998
ACM
15 years 4 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky
EDOC
2004
IEEE
15 years 3 months ago
Write Once, Deploy N: A Performance Oriented MDA Case Study
To focus the comparison of languages for model checking and transformation on criteria that matter in practical development, there is an urgent need for more, and more realistic, ...
Pieter Van Gorp, Dirk Janssens, Tracy Gardner
AGTIVE
2007
Springer
15 years 1 months ago
Adaptable Support for Queries and Transformations for the DRAGOS Graph-Database
Abstract. The DRAGOS database eases the development of graphbased applications by providing a uniform graph-oriented data storage facility. In this paper, we extend the existing da...
Erhard Weinell
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 13 days ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
MLDM
2007
Springer
15 years 6 months ago
Ensemble-based Feature Selection Criteria
Recursive Feature Elimination (RFE) combined with feature ranking is an effective technique for eliminating irrelevant features when the feature dimension is large, but it is diffi...
Terry Windeatt, Matthew Prior, Niv Effron, Nathan ...