Sciweavers

8132 search results - page 289 / 1627
» Dependability, Abstraction, and Programming
Sort
View
AAAI
1996
15 years 8 months ago
Generating Multiple New Designs From a Sketch
We describe a program called SketchIT that transforms a single sketch of a mechanical device into multiple families of new designs. It represents each of these families with a &qu...
Thomas F. Stahovich, Randall Davis, Howard E. Shro...
ENTCS
2007
109views more  ENTCS 2007»
15 years 6 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
AFPAC
2000
Springer
341views Mathematics» more  AFPAC 2000»
15 years 11 months ago
An Associative Perception-Action Structure Using a Localized Space Variant Information Representation
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...
Gösta H. Granlund
191
Voted
JSAC
2007
120views more  JSAC 2007»
15 years 6 months ago
On the Capacity of MIMO Wireless Channels with Dynamic CSIT
Abstract— Transmit channel side information (CSIT) can significantly increase MIMO wireless capacity. Due to delay in acquiring this information, however, the time-selective fad...
Mai Vu, Arogyaswami Paulraj
CADE
2001
Springer
16 years 7 months ago
A New Meta-complexity Theorem for Bottom-Up Logic Programs
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
Harald Ganzinger, David A. McAllester