120 search results - page 14 / 24 » How Much Can We Gain from Supervised Word Alignment |
KCAP
2011
ACM
13 years 1 months ago
2011
ACM
Open Information Extraction extracts relations from text without requiring a pre-specified domain or vocabulary. While existing techniques have used only shallow syntactic featur...
CN
2010
13 years 8 months ago
2010
Conventional simple p-cycle (Preconfigured Protection Cycle) concept allows fast and capacity-efficient span protection in WDM mesh networks. Unlike simple p-cycle, non-simple p-cy...
MP
2006
13 years 10 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
DAGM
2011
Springer
12 years 10 months ago
2011
Springer
The supervised learning paradigm assumes in general that both training and test data are sampled from the same distribution. When this assumption is violated, we are in the setting...
CORR
2000
Springer
13 years 10 months ago
2000
Springer
We describe a formal model for annotating linguistic artifacts, from which we derive an application programming interface (API) to a tools for manipulating these annotations. The ...