Sciweavers

1757 search results - page 109 / 352
» Alternating Refinement Relations
Sort
View
COLING
2002
15 years 3 months ago
Linking Syntactic and Semantic Arguments in a Dependency-based Formalism
We propose a formal characterization of variation in the syntactic realization of semantic arguments, using hierarchies of syntactic relations and thematic roles, and a mechanism ...
Christian Korthals, Ralph Debusmann
121
Voted
ACL
2011
14 years 7 months ago
Binarized Forest to String Translation
Tree-to-string translation is syntax-aware and efficient but sensitive to parsing errors. Forestto-string translation approaches mitigate the risk of propagating parser errors in...
Hao Zhang, Licheng Fang, Peng Xu, Xiaoyun Wu
ICML
2008
IEEE
16 years 4 months ago
Optimizing estimated loss reduction for active sampling in rank learning
Learning to rank is becoming an increasingly popular research area in machine learning. The ranking problem aims to induce an ordering or preference relations among a set of insta...
Pinar Donmez, Jaime G. Carbonell
PODS
2004
ACM
109views Database» more  PODS 2004»
16 years 3 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
GFKL
2005
Springer
125views Data Mining» more  GFKL 2005»
15 years 8 months ago
Towards Structure-sensitive Hypertext Categorization
Abstract. Hypertext categorization is the task of automatically assigning category labels to hypertext units. Comparable to text categorization it stays in the area of function lea...
Alexander Mehler, Rüdiger Gleim, Matthias Deh...