Sciweavers

304 search results - page 4 / 61
» An Efficient Method for Evaluating Complex Polynomials
Sort
View
CDB
2004
Springer
158views Database» more  CDB 2004»
13 years 11 months ago
Constraint Databases, Data Structures and Efficient Query Evaluation
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
Joos Heintz, Bart Kuijpers
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
13 years 12 months ago
Ranking - Methods for Flexible Evaluation and Efficient Comparison of Classification Performance
We present the notion of Ranking for evaluation of two-class classifiers. Ranking is based on using the ordering information contained in the output of a scoring model, rather tha...
Saharon Rosset
AISC
2008
Springer
13 years 9 months ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
PPDP
2010
Springer
13 years 5 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
ECML
2004
Springer
14 years 1 months ago
Inducing Polynomial Equations for Regression
Regression methods aim at inducing models of numeric data. While most state-of-the-art machine learning methods for regression focus on inducing piecewise regression models (regres...
Ljupco Todorovski, Peter Ljubic, Saso Dzeroski