Sciweavers

688 search results - page 69 / 138
» The Flow Set with Partial Order
Sort
View
CORR
2008
Springer
172views Education» more  CORR 2008»
14 years 10 months ago
Lecture notes on the lambda calculus
This is a set of lecture notes that developed out of courses on the lambda calculus that I taught at the University of Ottawa in 2001 and at Dalhousie University in 2007. Topics c...
Peter Selinger
IGPL
2008
103views more  IGPL 2008»
14 years 9 months ago
Transition Logic Revisited
A new version of transition logic is presented. It integrates (dynamic) transitions, which change world states, and classical (static) reasoning, restricted in the paper to Horn l...
Wolfgang Bibel
IJCGA
2006
79views more  IJCGA 2006»
14 years 9 months ago
Well-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
Gui-Fang Zhang, Xiao-Shan Gao
COMBINATORICS
2000
101views more  COMBINATORICS 2000»
14 years 9 months ago
Bound Graph Polysemy
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
Paul J. Tanenbaum
EMNLP
2010
14 years 7 months ago
Learning the Relative Usefulness of Questions in Community QA
We present a machine learning approach for the task of ranking previously answered questions in a question repository with respect to their relevance to a new, unanswered referenc...
Razvan C. Bunescu, Yunfeng Huang