Sciweavers

2899 search results - page 36 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
ICDE
1996
IEEE
103views Database» more  ICDE 1996»
16 years 2 months ago
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
Martin Sköld, Tore Risch
CORR
1999
Springer
116views Education» more  CORR 1999»
15 years 29 days ago
Efficient and Extensible Algorithms for Multi Query Optimization
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bh...
CAIP
1999
Springer
145views Image Analysis» more  CAIP 1999»
15 years 5 months ago
Optimized Fast Algorithms for the Quaternionic Fourier Transform
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
Michael Felsberg, Gerald Sommer
JMLR
2006
117views more  JMLR 2006»
15 years 1 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 1 months ago
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
Robert Hildebrand, Matthias Köppe