Sciweavers

7129 search results - page 675 / 1426
» Approximation Algorithms for Treewidth
Sort
View
187
Voted
ICPR
2008
IEEE
16 years 1 months ago
Regression with interval output values
We consider a regression problem where target values are given as intervals, and propose a statistical approach to it. Although it is hard to solve the optimization problem direct...
Hisashi Kashima, Kazutaka Yamasaki, Akihiro Inokuc...
188
Voted
EUROCAST
2007
Springer
111views Hardware» more  EUROCAST 2007»
16 years 1 months ago
From Text to Knowledge
In this paper, we present a new approximation in Natural Language Processing (nlp) aimed at knowledge representation and acquisition using a formal syntactic frame. In practice, we...
M. Fernández, Eric Villemonte de la Clerger...
155
Voted
ISSAC
2007
Springer
132views Mathematics» more  ISSAC 2007»
16 years 1 months ago
Structured matrix methods for polynomial root-finding
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
Luca Gemignani
IEEECGIV
2006
IEEE
16 years 1 months ago
Effects of Different Order PDEs on Blending Surfaces
In this paper, we introduce second order and mixed order partial differential equations (PDEs) for surface blending and present an approximate algorithm for the resolution of the ...
Lihua You, Jian J. Zhang
FOCS
2003
IEEE
16 years 23 days ago
Polynomial Degree vs. Quantum Query Complexity
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
Andris Ambainis