Sciweavers

2766 search results - page 286 / 554
» Algorithms for trigonometric polynomials
Sort
View
ICML
2005
IEEE
16 years 5 months ago
A support vector method for multivariate performance measures
This paper presents a Support Vector Method for optimizing multivariate nonlinear performance measures like the F1score. Taking a multivariate prediction approach, we give an algo...
Thorsten Joachims
129
Voted
CADE
2005
Springer
16 years 5 months ago
Well-Nested Context Unification
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
Jordi Levy, Joachim Niehren, Mateu Villaret
114
Voted
ICS
2010
Tsinghua U.
16 years 2 months ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial
CASC
2009
Springer
157views Mathematics» more  CASC 2009»
15 years 11 months ago
On the Complexity of Reliable Root Approximation
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
Michael Kerber
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
15 years 11 months ago
On the semantics and evaluation of top-k queries in probabilistic databases
We formulate three intuitive semantic properties for topk queries in probabilistic databases, and propose GlobalTopk query semantics which satisfies all of them. We provide a dyn...
Xi Zhang, Jan Chomicki