Sciweavers

4934 search results - page 181 / 987
» complexity 2008
Sort
View
IPL
2008
65views more  IPL 2008»
15 years 4 months ago
On the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
Iain A. Stewart
SCP
2002
119views more  SCP 2002»
15 years 4 months ago
Polymorphic subtyping in O'Haskell
O'Haskell is a programming language derived from Haskell by the addition of concurrent reactive objects and subtyping. Because Haskell already encompasses an advanced type sy...
Johan Nordlander
SIAMSC
2008
92views more  SIAMSC 2008»
15 years 4 months ago
A Novel Pricing Method for European Options Based on Fourier-Cosine Series Expansions
Here we develop an option pricing method for European options based on the Fourier-cosine series, and call it the COS method. The key insight is in the close relation of the charac...
F. Fang, Cornelis W. Oosterlee
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
16 years 2 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi
AIML
2008
15 years 6 months ago
An interval logic for natural language semantics
Most temporal logics, particularly interval temporal logics, are not expressive enough to capture meanings of natural language constructions, and they are not convenient to represe...
Savas Konur