Sciweavers

4498 search results - page 845 / 900
» How to Invent Functions
Sort
View
FPCA
1989
14 years 1 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
ANCS
2007
ACM
14 years 1 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
ECBS
2009
IEEE
114views Hardware» more  ECBS 2009»
14 years 1 months ago
Model-Based Product-Oriented Certification
Future space missions such as the Mars Science Laboratory and Project Constellation suggest the engineering of some of the most complex man-rated software systems. The present pro...
Damian Dechev, Bjarne Stroustrup
EDBT
2009
ACM
170views Database» more  EDBT 2009»
14 years 1 months ago
Efficient constraint evaluation in categorical sequential pattern mining for trajectory databases
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
Leticia I. Gómez, Alejandro A. Vaisman
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
14 years 1 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson