Sciweavers

107 search results - page 13 / 22
» Generation of Referring Expressions: Managing Structural Amb...
Sort
View
COLING
1996
14 years 11 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
COOPIS
1999
IEEE
15 years 1 months ago
Looking at the Web through XML Glasses
The Web so far has been incredibly successful at delivering information to human users. So successful actually, that there is now an urgent need to go beyond a browsing human and ...
Arnaud Sahuguet, Fabien Azavant
ASE
2010
129views more  ASE 2010»
14 years 9 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...
PKDD
2004
Springer
205views Data Mining» more  PKDD 2004»
15 years 3 months ago
Breaking Through the Syntax Barrier: Searching with Entities and Relations
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
Soumen Chakrabarti
IWMM
2007
Springer
85views Hardware» more  IWMM 2007»
15 years 3 months ago
Uniqueness inference for compile-time object deallocation
This paper presents an analysis and transformation for individual object reclamation in Java programs. First, we propose a uniqueness inference algorithm that identifies variable...
Sigmund Cherem, Radu Rugina