Sciweavers

9626 search results - page 325 / 1926
» Invariant Based Programming
Sort
View
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
15 years 10 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
EUROPAR
1997
Springer
15 years 10 months ago
A Relational Approach to the Compilation of Sparse Matrix Programs
Abstract. We present a relational algebra based framework for compiling e cient sparse matrix code from dense DO-ANY loops and a speci cation of the representation of the sparse ma...
Vladimir Kotlyar, Keshav Pingali, Paul Stodghill
ICIP
2003
IEEE
16 years 8 months ago
Gradient field distributions for the registration of images
This paper introduces a new method to register images that are rotated and translated with respect to each other. The method works by transforming each image to a gradient distrib...
Joshua Gluckman
CVPR
1999
IEEE
16 years 7 months ago
Algebraic Curves That Work Better
An algebraic curve is defined as the zero set of a polynomial in two variables. Algebraic curves are practical for modeling shapes much more complicated than conics or su...
David B. Cooper, Jean-Philippe Tarel, Tolga Tasdiz...
WIAMIS
2009
IEEE
16 years 1 months ago
The fast-3D spatio-temporal interest region detector
Spatio-temporal interest region detectors can be used in the analysis of video to determine sparse, informative regions as candidates for feature extraction. In this paper we comp...
Sander Koelstra, Ioannis Patras