Sciweavers

89 search results - page 4 / 18
» Effective Set Membership in Computer Algebra and Beyond
Sort
View
APAL
2002
77views more  APAL 2002»
13 years 9 months ago
Degree spectra and computable dimensions in algebraic structures
Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classe...
Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richar...
CVPR
2007
IEEE
14 years 11 months ago
Image representations beyond histograms of gradients: The role of Gestalt descriptors
Histograms of orientations and the statistics derived from them have proven to be effective image representations for various recognition tasks. In this work we attempt to improve...
Stanley M. Bileschi, Lior Wolf
POPL
2012
ACM
12 years 5 months ago
Algebraic foundations for effect-dependent optimisations
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
Ohad Kammar, Gordon D. Plotkin
DBPL
1991
Springer
98views Database» more  DBPL 1991»
14 years 1 months ago
Structural Recursion as a Query Language
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
Val Tannen, Peter Buneman, Shamim A. Naqvi
APL
1998
ACM
14 years 2 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