Sciweavers

7978 search results - page 306 / 1596
» Representation before computation
Sort
View
TLCA
2009
Springer
16 years 1 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey
142
Voted
DAC
1998
ACM
15 years 11 months ago
M32: A Constructive multilevel Logic Synthesis System
We describe a new constructive multilevel logic synthesis system that integrates the traditionally separate technology-independent and technology-dependent stages of modern synthe...
Victor N. Kravets, Karem A. Sakallah
SIGGRAPH
1994
ACM
15 years 10 months ago
Smooth spline surfaces over irregular meshes
An algorithm for creating smooth spline surfaces over irregular meshes is presented. The algorithm is a generalization of quadratic B-splines; that is, if a mesh is (locally) regu...
Charles T. Loop
ECCV
2010
Springer
15 years 6 months ago
Tensor Sparse Coding for Region Covariances
Sparse representation of signals has been the focus of much research in the recent years. A vast majority of existing algorithms deal with vectors, and higher
Ravishankar Sivalingam, Daniel Boley, Vassilios Mo...
ACL
2010
15 years 4 months ago
Tackling Sparse Data Issue in Machine Translation Evaluation
We illustrate and explain problems of n-grams-based machine translation (MT) metrics (e.g. BLEU) when applied to morphologically rich languages such as Czech. A novel metric SemPO...
Ondrej Bojar, Kamil Kos, David Marecek