Sciweavers

867 search results - page 38 / 174
» On Two Forms of Structural Recursion
Sort
View
71
Voted
ACL
1996
15 years 1 months ago
Using Parsed Corpora for Structural Disambiguation in the TRAINS Domain
This paper describes a prototype disambiguation module, KANKEI, which was tested on two corpora of the TRAINS project. In ambiguous verb phrases of form V ... NP PP or V ... NP ad...
Mark G. Core
CHI
2005
ACM
16 years 27 days ago
Programmatic semantics for natural language interfaces
An important way of making interfaces usable by nonexpert users is to enable the use of natural language input, as in natural language query interfaces to databases, or MUDs and M...
Hugo Liu, Henry Lieberman
93
Voted
WSC
1998
15 years 1 months ago
Multimodels and Dynamic Structure Models: An Integration of DSDE/DEVS and OOPM
Constructing models of systems that change their structure over time has proved to be a challenging problem, with several proposed solutions. We present two of these approaches an...
Fernando J. Barros, Bernard P. Zeigler, Paul A. Fi...
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
15 years 4 months ago
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
94
Voted
CORR
2008
Springer
156views Education» more  CORR 2008»
15 years 18 days ago
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x...
Paul Tarau