Sciweavers

8094 search results - page 24 / 1619
» Improvements in Formula Generalization
Sort
View
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 1 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
ADCM
2010
129views more  ADCM 2010»
13 years 7 months ago
Construction of positive definite cubature formulae and approximation of functions via Voronoi tessellations
Let Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal propert...
Allal Guessab, Gerhard Schmeisser
ISAAC
2004
Springer
107views Algorithms» more  ISAAC 2004»
14 years 1 months ago
On the Hardness and Easiness of Random 4-SAT Formulas
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
Andreas Goerdt, André Lanka
CORR
2008
Springer
66views Education» more  CORR 2008»
13 years 7 months ago
A Novel Approach to Formulae Production and Overconfidence Measurement to Reduce Risk in Spreadsheet Modelling
Research on formulae production in spreadsheets has established the practice as high risk yet unrecognised as such by industry. There are numerous software applications that are d...
Simon R. Thorne, David Ball, Zoe Lawson
AAECC
2005
Springer
99views Algorithms» more  AAECC 2005»
13 years 7 months ago
Formulae for Arithmetic on Genus 2 Hyperelliptic Curves
The ideal class group of hyperelliptic curves can be used in cryptosystems based on the discrete logarithm problem. In this article we present explicit formulae to perform the gro...
Tanja Lange