5864 search results - page 224 / 1173 » Can We Work around Numerical Methods |
127
click to vote
FSTTCS
2008
Springer
15 years 6 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
118
click to vote
FS
2006
15 years 5 months ago
2006
In the present paper we provide an analytical solution for pricing discrete barrier options in the Black-Scholes framework. We reduce the valuation problem to a Wiener-Hopf equatio...
157
click to vote
COLING
2002
15 years 5 months ago
2002
Named Entity (NE) recognition is a task in which proper nouns and numerical information are extracted from documents and are classified into categories such as person, organizatio...
133
Voted
SIAMJO
2000
15 years 4 months ago
2000
Abstract. We consider column sufficient linear complementarity problems and study the problem of identifying those variables that are zero at a solution. To this end we propose a n...
134
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
Most recent schema matching systems assemble multiple components, each employing a particular matching technique. The domain user must then tune the system: select the right compo...