Sciweavers

468 search results - page 37 / 94
» Parsing and Subcategorization Data
Sort
View
NLP
2000
14 years 19 days ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
SOUPS
2006
ACM
14 years 3 months ago
An empirical study of natural language parsing of privacy policy rules using the SPARCLE policy workbench
Today organizations do not have good ways of linking their written privacy policies with the implementation of those policies. To assist organizations in addressing this issue, ou...
Carolyn Brodie, Clare-Marie Karat, John Karat
CVPR
1998
IEEE
14 years 11 months ago
Action Recognition Using Probabilistic Parsing
A new approach to the recognition of temporal behaviors and activities is presented. The fundamental idea, inspired by work in speech recognition, is to divide the inference probl...
Aaron F. Bobick, Yuri A. Ivanov
SIGMOD
2004
ACM
142views Database» more  SIGMOD 2004»
14 years 9 months ago
Understanding Web Query Interfaces: Best-Effort Parsing with Hidden Syntax
Recently, the Web has been rapidly "deepened" by many searchable databases online, where data are hidden behind query forms. For modelling and integrating Web databases,...
Zhen Zhang, Bin He, Kevin Chen-Chuan Chang
WCRE
1993
IEEE
14 years 1 months ago
Flexible Control for Program Recognition
Recognizing commonly used data structures and algorithms is a key activity in reverse engineering. Systems developed to automate this recognition process have been isolated, stand...
Linda M. Wills