Sciweavers

9509 search results - page 301 / 1902
» Complex Event Processing
Sort
View
IJCNLP
2004
Springer
16 years 2 days ago
Tagging Complex NEs with MaxEnt Models: Layered Structures Versus Extended Tagset
The paper discusses two policies for recognizing NEs with complex structures by maximum entropy models. One policy is to develop cascaded MaxEnt models at different levels. The ot...
Deyi Xiong, Hongkui Yu, Qun Liu
DAGM
2003
Springer
15 years 12 months ago
Training and Recognition of Complex Scenes Using a Holistic Statistical Model
We present a holistic statistical model for the automatic analysis of complex scenes. Here, holistic refers to an integrated approach that does not take local decisions about segme...
Daniel Keysers, Michael Motter, Thomas Deselaers, ...
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
15 years 11 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
STACS
2001
Springer
15 years 11 months ago
Small PCPs with Low Query Complexity
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
Prahladh Harsha, Madhu Sudan
FLAIRS
2007
15 years 9 months ago
A Linguistically-Based Segmentation of Complex Sentences
The paper describes a method of dividing complex sentences into segments, easily detectable and linguistically motivated units, which may provide a basis for further processing of...
Vladislav Kubon, Markéta Lopatková, ...