1412 search results - page 37 / 283 » types 2004 |
108
Voted
DAGSTUHL
2004
15 years 4 months ago
2004
The topic of the talk were the time approximation of quasi linear stochastic partial differential equations of parabolic type. The framework were in the setting of stochastic evolu...
94
Voted
CLIN
2001
15 years 4 months ago
2001
In this paper we present a definition of Performance Grammar (PG), a psycholinguistically motivated syntax formalism, in declarative terms. PG aims not only at describing and expl...
113
Voted
ECOOP
2004
Springer
15 years 8 months ago
2004
Springer
The expression problem (aka the extensibility problem) refers to a fundamental dilemma of programming: Can your application be structured in such a way that both the data model and...
157
Voted
ACL
2009
15 years 17 days ago
2009
Creating labeled training data for relation extraction is expensive. In this paper, we study relation extraction in a special weakly-supervised setting when we have only a few see...
108
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...