1999 search results - page 156 / 400 » Dependently Typed Grammars |
198
click to vote
IJCAI
2001
15 years 7 months ago
2001
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...
160
click to vote
EOR
2008
15 years 6 months ago
2008
In Multi-Protocol Label Switching (MPLS) networks, traffic demands can be routed along tunnels called Label Switched Paths (LSPs). A tunnel is characterized by a path in the netwo...
220
click to vote
EMNLP
2011
14 years 6 months ago
2011
We explore unsupervised approaches to relation extraction between two named entities; for instance, the semantic bornIn relation between a person and location entity. Concretely, ...
284
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
181
click to vote
TACS
1994
Springer
15 years 10 months ago
1994
Springer
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...