Sciweavers

815 search results - page 96 / 163
» Algebraic Recognizability of Languages
Sort
View
259
Voted
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
16 years 6 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
171
Voted
POPL
2009
ACM
16 years 29 days ago
Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
Abdallah Al Zain, Kevin Hammond, Jost Berthold, Ph...
155
Voted
FOSSACS
2010
Springer
16 years 1 months ago
CIA Structures and the Semantics of Recursion
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
Stefan Milius, Lawrence S. Moss, Daniel Schwencke
135
Voted
AHS
2007
IEEE
262views Hardware» more  AHS 2007»
15 years 8 months ago
A Reed-Solomon Algorithm for FPGA Area Optimization in Space Applications
This work describes an algebraic based design strategy targeting area optimization in reconfigurable computer technology (FPGA). Area optimization is a major issue as smaller comp...
Gabriel Marchesan Almeida, Eduardo Augusto Bezerra...
161
Voted
LFP
1990
171views more  LFP 1990»
15 years 7 months ago
Operational and Axiomatic Semantics of PCF
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
Brian T. Howard, John C. Mitchell