Sciweavers

1757 search results - page 97 / 352
» Alternating Refinement Relations
Sort
View
ACL
1996
15 years 4 months ago
Integrating Multiple Knowledge Sources to Disambiguate Word Sense: An Exemplar-Based Approach
In this paper, we present a new approach for word sense disambiguation (WSD) using an exemplar-based learning algorithm. This approach integrates a diverse set of knowledge source...
Hwee Tou Ng, Hian Beng Lee
102
Voted
COLING
1996
15 years 4 months ago
Extraction of Lexical Translations from Non-Aligned Corpora
A method for extracting lexical translations from non-aligned corpora is proposed to cope with the unavailability of large aligned corpus. The assumption that "translations o...
Kumiko Tanaka, Hideya Iwasaki
AMC
2006
107views more  AMC 2006»
15 years 3 months ago
Linear bilevel programming with upper level constraints depending on the lower level solution
Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In th...
Ayalew Getachew Mersha, Stephan Dempe
116
Voted
ENTCS
2006
143views more  ENTCS 2006»
15 years 3 months ago
Hiproofs: A Hierarchical Notion of Proof Tree
Motivated by the concerns of theorem-proving, we generalise the notion of proof tree to that of hierarchical proof tree. Hierarchical trees extend ordinary trees by adding partial...
Ewen Denney, John Power, Konstantinos Tourlas
DATAMINE
2000
113views more  DATAMINE 2000»
15 years 3 months ago
Informix under CONTROL: Online Query Processing
The goal of the CONTROL project at Berkeley is to develop systems for interactive analysis of large data sets. We focus on systems that provide users with iteratively refining answ...
Joseph M. Hellerstein, Ron Avnur, Vijayshankar Ram...