Sciweavers

9507 search results - page 1805 / 1902
» Time-based language models
Sort
View
ENTCS
2007
121views more  ENTCS 2007»
15 years 2 months ago
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract)
ly positive maps (extended abstract) Peter Selinger 1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories ...
Peter Selinger
ENTCS
2007
105views more  ENTCS 2007»
15 years 2 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
132
Voted
ENTCS
2007
128views more  ENTCS 2007»
15 years 2 months ago
Optimisation Validation
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
David Aspinall, Lennart Beringer, Alberto Momiglia...
KES
2006
Springer
15 years 2 months ago
Integrated Document Browsing and Data Acquisition for Building Large Ontologies
Named entities (e.g., "Kofi Annan", "Coca-Cola", "Second World War") are ubiquitous in web pages and other types of document and often provide a simpl...
Felix Weigel, Klaus U. Schulz, Levin Brunner, Edua...
113
Voted
LISP
2006
105views more  LISP 2006»
15 years 2 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
« Prev « First page 1805 / 1902 Last » Next »