Sciweavers

95 search results - page 8 / 19
» Higher-order Carmichael numbers
Sort
View
CAV
2009
Springer
215views Hardware» more  CAV 2009»
14 years 11 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong
POPL
2010
ACM
14 years 8 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
POPL
2010
ACM
14 years 8 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 11 months ago
The Equivalence of Semidefinite Relaxation MIMO Detectors for Higher-Order QAM
In multi-input multi-output (MIMO) detection, semidefinite relaxation (SDR) has been shown to be an efficient high-performance approach. For BPSK and QPSK, it has been found that S...
Wing-Kin Ma, Chao-Cheng Su, Joakim Jalden, Tsung-H...
COMGEO
2011
ACM
13 years 5 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...