Sciweavers

1413 search results - page 15 / 283
» ideas 2007
Sort
View
ACL
1994
14 years 10 months ago
Generalized Chart Algorithm: An Efficient Procedure for Cost-Based Abduction
We present an efficient procedure for cost-based abduction, which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algor...
Yasuharu Den
76
Voted
CASCON
1996
104views Education» more  CASCON 1996»
14 years 10 months ago
Live WWW and its agents: the CAS-LWWW project
This paper proposes the idea of vision agents over Internet, outlines the performance models of Live WWW with agents, and describes an object search agent and its communications w...
Yiming Ye, John K. Tsotsos, Karen Bennet
ACL
1992
14 years 10 months ago
Connection Relations and Quantifier Scope
A formalism will be presented in this paper which makes it possible to realise the idea of assigning only one scope-ambiguous representation to a sentence that is ambiguous with r...
Longin Jan Latecki
APPML
2007
95views more  APPML 2007»
14 years 9 months ago
On the solvability of two-point, second-order boundary value problems
We gain solvability to a system of nonlinear, second-order ordinary differential equations subject to a range of boundary conditions. The ideas involve differential inequalities...
Matthew Rudd, Christopher C. Tisdell
78
Voted
COMBINATORICS
2007
68views more  COMBINATORICS 2007»
14 years 9 months ago
Compositions of Graphs Revisited
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
Aminul Huq